Stefano Gualandi

Orcid: 0000-0002-2111-3528

According to our database1, Stefano Gualandi authored at least 47 papers between 2008 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
On the generation of metric TSP instances with a large integrality gap by branch-and-cut.
Math. Program. Comput., June, 2023

The BeMi Stardust: A Structured Ensemble of Binarized Neural Networks.
Proceedings of the Learning and Intelligent Optimization - 17th International Conference, 2023

2022
Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming.
INFORMS J. Comput., 2022

Total Coloring and Total Matching: Polyhedra and Facets.
Eur. J. Oper. Res., 2022

A kinetic description of the body size distributions of species.
CoRR, 2022

A SAT Encoding to Compute Aperiodic Tiling Rhythmic Canons.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2022

2021
The Fourier Loss Function.
CoRR, 2021

The Gene Mover's Distance: Single-cell similarity via Optimal Transport.
CoRR, 2021

2020
On the Computation of Kantorovich-Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows.
SIAM J. Optim., 2020

Primal Heuristics for Wasserstein Barycenters.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2020

2019
Handling preferences in student-project allocation.
Ann. Oper. Res., 2019

Computing Wasserstein Barycenters via Linear Programming.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2019

2018
Quantum-Inspired Evolutionary Multiobjective Optimization for a Dynamic Production Scheduling Approach.
Proceedings of the Multidisciplinary Approaches to Neural Computing, 2018

Computing Kantorovich-Wasserstein Distances on d-dimensional histograms using (d+1)-partite graphs.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017
On the Separation of Topology-Free Rank Inequalities for the Max Stable Set Problem.
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

2016
Lower bounding procedure for the asymmetric quadratic traveling salesman problem.
Eur. J. Oper. Res., 2016

A lagrangian propagator for artificial neural networks in constraint programming.
Constraints An Int. J., 2016

2014
Coordinated cutting plane generation via multi-objective separation.
Math. Program., 2014

2013
A branch-and-price approach to <i>k</i>-clustering minimum biclique completion problem.
Int. Trans. Oper. Res., 2013

Constraint Programming-based Column Generation.
Ann. Oper. Res., 2013

Quadratic TSP: A lower bounding procedure and a column generation approach.
Proceedings of the 2013 Federated Conference on Computer Science and Information Systems, 2013

A New Propagator for Two-Layer Neural Networks in Empirical Model Learning.
Proceedings of the Principles and Practice of Constraint Programming, 2013

A Simple and Effective Decomposition for the Multidimensional Binpacking Constraint.
Proceedings of the Principles and Practice of Constraint Programming, 2013

Coloring of paths into forests.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

Resource Optimization in Multiradio Multichannel Wireless Mesh Networks.
Proceedings of the Mobile Ad Hoc Networking: Cutting Edge Directions, Second Edition, 2013

2012
Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation.
INFORMS J. Comput., 2012

The balanced academic curriculum problem revisited.
J. Heuristics, 2012

A simple branching scheme for vertex coloring problems.
Discret. Appl. Math., 2012

Resource Constrained Shortest Paths with a Super Additive Objective Function.
Proceedings of the Principles and Practice of Constraint Programming, 2012

2011
A New Computational Approach for Maximum Link Activation in Wireless Networks under the SINR Model.
IEEE Trans. Wirel. Commun., 2011

Joint routing and scheduling optimization in arbitrary ad hoc networks: Comparison of cooperative and hop-by-hop forwarding.
Ad Hoc Networks, 2011

On Minimum Changeover Cost Arborescences.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Optimizing cooling and server power consumption.
Proceedings of the IEEE International Conference on Intelligent Computer Communication and Processing, 2011

On the Cooling-Aware Workload Placement Problem.
Proceedings of the AI for Data Center Management and Cloud Computing, 2011

2010
A multiagent architecture for controlling the Palamede satellite.
Web Intell. Agent Syst., 2010

Computational experience with a SDP-based algorithm for maximum cut with limited unbalance.
Networks, 2010

Solving a resource allocation problem in wireless mesh networks: A comparison between a CP-based and a classical column generation.
Networks, 2010

On Minimum Reload Cost Cycle Cover.
Electron. Notes Discret. Math., 2010

Routing, scheduling and channel assignment in Wireless Mesh Networks: Optimization models and algorithms.
Ad Hoc Networks, 2010

Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

On the Design of the Next Generation Access Networks.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2010

A Constraint Programming Approach for the Service Consolidation Problem.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2010

On the Design of the Fiber To The Home Networks.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

2009
Enhancing CP-based column generation for integer programs.
4OR, 2009

k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2009

2008
Exact Graph Coloring via Hybrid Approaches.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008


  Loading...