Stefano Gualandi

Ambrogio Maria Bernardelli

EURO J. Comput. Optim., 2024

On the integrality gap of the Complete Metric Steiner Tree Problem via a novel formulation.

[BibT_eX]

[DOI]

Eleonora Vercesi

Monaldo Mastrolilli

Luca Maria Gambardella

CoRR, 2024

Learning Sparse-Lets for Interpretable Classification of Event-interval Sequences.

[BibT_eX]

[DOI]

Lorenzo Bonasera

Davide Duma

Proceedings of the Metaheuristics - 15th International Conference, 2024

2023

On the generation of metric TSP instances with a large integrality gap by branch-and-cut.

[BibT_eX]

[DOI]

Eleonora Vercesi

Ambrogio Maria Bernardelli

Monaldo Mastrolilli

Luca Maria Gambardella

Math. Program. Comput., June, 2023

The BeMi Stardust: A Structured Ensemble of Binarized Neural Networks.

[BibT_eX]

[DOI]

Hoong Chuin Lau

Simone Milanesi

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.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2022

Total Coloring and Total Matching: Polyhedra and Facets.

[BibT_eX]

[DOI]

Luca Ferrarini

Eur. J. Oper. Res., 2022

A kinetic description of the body size distributions of species.

[BibT_eX]

[DOI]

Giuseppe Toscani

Eleonora Vercesi

CoRR, 2022

A SAT Encoding to Compute Aperiodic Tiling Rhythmic Canons.

[BibT_eX]

[DOI]

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2022

2021

The Fourier Loss Function.

[BibT_eX]

[DOI]

CoRR, 2021

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

[BibT_eX]

[DOI]

CoRR, 2021

2020

On the Computation of Kantorovich-Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows.

[BibT_eX]

[DOI]

Federico Bassetti

Marco Veneroni

SIAM J. Optim., 2020

Primal Heuristics for Wasserstein Barycenters.

[BibT_eX]

[DOI]

Pierre-Yves Bouchet

Louis-Martin Rousseau

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2020

2019

Handling preferences in student-project allocation.

[BibT_eX]

[DOI]

Marco Chiarandini

Rolf Fagerberg

Ann. Oper. Res., 2019

Computing Wasserstein Barycenters via Linear Programming.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Multidisciplinary Approaches to Neural Computing, 2018

Computing Kantorovich-Wasserstein Distances on d-dimensional histograms using (d+1)-partite graphs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

2016

Lower bounding procedure for the asymmetric quadratic traveling salesman problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2016

A lagrangian propagator for artificial neural networks in constraint programming.

[BibT_eX]

[DOI]

Michele Lombardi

Constraints An Int. J., 2016

2014

Coordinated cutting plane generation via multi-objective separation.

[BibT_eX]

[DOI]

Edoardo Amaldi

Math. Program., 2014

On Minimum Reload Cost Cycle Cover.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

2013

A branch-and-price approach to <i>k</i>-clustering minimum biclique completion problem.

[BibT_eX]

[DOI]

Claudio Magni

Int. Trans. Oper. Res., 2013

Quadratic TSP: A lower bounding procedure and a column generation approach.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Michele Lombardi

Proceedings of the Principles and Practice of Constraint Programming, 2013

A Simple and Effective Decomposition for the Multidimensional Binpacking Constraint.

[BibT_eX]

[DOI]

Michele Lombardi

Proceedings of the Principles and Practice of Constraint Programming, 2013

Coloring of paths into forests.

[BibT_eX]

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

Resource Optimization in Multiradio Multichannel Wireless Mesh Networks.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2012

The balanced academic curriculum problem revisited.

[BibT_eX]

[DOI]

J. Heuristics, 2012

A simple branching scheme for vertex coloring problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Resource Constrained Shortest Paths with a Super Additive Objective Function.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

IEEE Trans. Wirel. Commun., 2011

Joint routing and scheduling optimization in arbitrary ad hoc networks: Comparison of cooperative and hop-by-hop forwarding.

[BibT_eX]

[DOI]

Antonio Capone

Di Yuan

Ad Hoc Networks, 2011

On Minimum Changeover Cost Arborescences.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Optimizing cooling and server power consumption.

[BibT_eX]

[DOI]

Paolo Cremonesi

Andrea Sansottera

Proceedings of the IEEE International Conference on Intelligent Computer Communication and Processing, 2011

On the Cooling-Aware Workload Placement Problem.

[BibT_eX]

[DOI]

Paolo Cremonesi

Andrea Sansottera

Proceedings of the AI for Data Center Management and Cloud Computing, 2011

2010

A multiagent architecture for controlling the Palamede satellite.

[BibT_eX]

[DOI]

Web Intell. Agent Syst., 2010

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

[BibT_eX]

[DOI]

Networks, 2010

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

[BibT_eX]

[DOI]

Networks, 2010

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

[BibT_eX]

[DOI]

Ad Hoc Networks, 2010

Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation.

[BibT_eX]

[DOI]

Edoardo Amaldi

Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

On the Design of the Next Generation Access Networks.

[BibT_eX]

[DOI]

Domenico L. Sozzi

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.

[BibT_eX]

[DOI]

Kanika Dhyani

Paolo Cremonesi

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.

[BibT_eX]

Domenico L. Sozzi

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.

[BibT_eX]

Claudio Magni

Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

2009

Constraint programming-based column generation.

[BibT_eX]

[DOI]

4OR, 2009

Enhancing CP-based column generation for integer programs.

[BibT_eX]

[DOI]

4OR, 2009

k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2009

2008

Exact Graph Coloring via Hybrid Approaches.

[BibT_eX]