Marco Di Summa

According to our database, Marco Di Summa authored at least 39 papers between 2007 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

The role of rationality in integer-programming relaxations.

Manuel Aprile, Gennadiy Averkov, Marco Di Summa, Christopher Hojny

Math. Program., May, 2024

2023

Critical node/edge detection problems on trees.

Marco Di Summa, Syed Md Omar Faruk

4OR, September, 2023

Towards Lower Bounds on the Depth of ReLU Neural Networks.

Christoph Hertrich, Amitabh Basu, Marco Di Summa, Martin Skutella

SIAM J. Discret. Math., June, 2023

Complexity of branch-and-bound and cutting planes in mixed-integer optimization.

Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang

Math. Program., March, 2023

2022

Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II.

Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang

Comb., December, 2022

2021

Split Cuts in the Plane.

Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang

SIAM J. Optim., 2021

Binary extended formulations and sequential convexification.

Manuel Aprile, Michele Conforti, Marco Di Summa

CoRR, 2021

Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective.

Michele Conforti, Marianna De Santis, Marco Di Summa, Francesco Rinaldi

4OR, 2021

2020

Piecewise smooth extreme functions are piecewise linear.

Marco Di Summa

Math. Program., 2020

Balas formulation for the union of polytopes is optimal.

Michele Conforti, Marco Di Summa, Yuri Faenza

Math. Program., 2020

An extreme function which is nonnegative and discontinuous everywhere.

Amitabh Basu, Michele Conforti, Marco Di Summa

Math. Program., 2020

Complexity of cutting planes and branch-and-bound in mixed-integer optimization.

Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang

CoRR, 2020

2019

Optimal Cutting Planes from the Group Relaxations.

Amitabh Basu, Michele Conforti, Marco Di Summa, Giacomo Zambelli

Math. Oper. Res., 2019

The Structure of the Infinite Models in Integer Programming.

Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat

Math. Oper. Res., 2019

2018

Extreme functions with an arbitrary number of slopes.

Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat

Math. Program., 2018

2016

Maximal S-Free Convex Sets and the Helly Number.

Michele Conforti, Marco Di Summa

SIAM J. Discret. Math., 2016

2015

Reverse Chvátal-Gomory Rank.

Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza, Roland Grappe

SIAM J. Discret. Math., 2015

A short convex-hull proof for the all-different system with the inclusion property.

Marco Di Summa

Oper. Res. Lett., 2015

Reverse split rank.

Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza

Math. Program., 2015

A geometric approach to cut-generating functions.

Amitabh Basu, Michele Conforti, Marco Di Summa

Math. Program., 2015

A branch-price-and-cut algorithm for the minimum evolution problem.

Daniele Catanzaro, Roberto Aringhieri, Marco Di Summa, Raffaele Pesenti

Eur. J. Oper. Res., 2015

Finding the closest ultrametric.

Marco Di Summa, David Pritchard, Laura Sanità

Discret. Appl. Math., 2015

On largest volume simplices and sub-determinants.

Marco Di Summa, Friedrich Eisenbrand, Yuri Faenza, Carsten Moldenhauer

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

On Sub-determinants and the Diameter of Polyhedra.

Nicolas Bonifas, Marco Di Summa, Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier

Discret. Comput. Geom., 2014

2013

On the Convergence of the Affine Hull of the Chvátal-Gomory Closures.

Gennadiy Averkov, Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza

SIAM J. Discret. Math., 2013

Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth.

Bernardetta Addis, Marco Di Summa, Andrea Grosso

Discret. Appl. Math., 2013

2012

Branch and cut algorithms for detecting critical nodes in undirected graphs.

Marco Di Summa, Andrea Grosso, Marco Locatelli

Comput. Optim. Appl., 2012

2011

Mixing Sets Linked by Bidirected Paths.

Marco Di Summa, Laurence A. Wolsey

SIAM J. Optim., 2011

Erratum: Lot-Sizing with Stock Upper Bounds and Fixed Charges.

Marco Di Summa, Laurence A. Wolsey

SIAM J. Discret. Math., 2011

Complexity of the critical node problem over trees.

Marco Di Summa, Andrea Grosso, Marco Locatelli

Comput. Oper. Res., 2011

Optimal solutions for the balanced minimum evolution problem.

Roberto Aringhieri, Daniele Catanzaro, Marco Di Summa

Comput. Oper. Res., 2011

2010

Lot-Sizing with Stock Upper Bounds and Fixed Charges.

Marco Di Summa, Laurence A. Wolsey

SIAM J. Discret. Math., 2010

On a class of mixed-integer sets with a single integer variable.

Marco Di Summa

Oper. Res. Lett., 2010

2009

Network Formulations of Mixed-Integer Programs.

Michele Conforti, Marco Di Summa, Friedrich Eisenbrand, Laurence A. Wolsey

Math. Oper. Res., 2009

2008

Lot-sizing on a tree.

Marco Di Summa, Laurence A. Wolsey

Oper. Res. Lett., 2008

The Mixing Set with Divisible Capacities.

Michele Conforti, Marco Di Summa, Laurence A. Wolsey

Proceedings of the Integer Programming and Combinatorial Optimization, 2008

2007

The Mixing Set with Flows.

Michele Conforti, Marco Di Summa, Laurence A. Wolsey

SIAM J. Discret. Math., 2007

Minimally Infeasible Set-Partitioning Problems with Balanced Constraints.

Michele Conforti, Marco Di Summa, Giacomo Zambelli

Math. Oper. Res., 2007

The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows.

Michele Conforti, Marco Di Summa, Laurence A. Wolsey

Proceedings of the Integer Programming and Combinatorial Optimization, 2007