Marco Di Summa

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 23

Top Topics

Integer Programming

Lagrangian Heuristic

Top Venues

SIAM J. Discret. Math.

Publications

Manuel Aprile, Gennadiy Averkov, Marco Di Summa, Christopher Hojny
The role of rationality in integer-programming relaxations. Math. Program. 205 (1) (2024)
Marco Di Summa, Syed Md Omar Faruk
Critical node/edge detection problems on trees. 4OR 21 (3) (2023)
Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang
Complexity of branch-and-bound and cutting planes in mixed-integer optimization. Math. Program. 198 (1) (2023)
Christoph Hertrich, Amitabh Basu, Marco Di Summa, Martin Skutella
Towards Lower Bounds on the Depth of ReLU Neural Networks. SIAM J. Discret. Math. 37 (2) (2023)
Manuel Aprile, Gennadiy Averkov, Marco Di Summa, Christopher Hojny
The role of rationality in integer-programming relaxations. CoRR (2022)
Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang
Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II. Comb. 42 (6) (2022)
Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang
Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II. IPCO (2021)
Christoph Hertrich, Amitabh Basu, Marco Di Summa, Martin Skutella
Towards Lower Bounds on the Depth of ReLU Neural Networks. CoRR (2021)
Michele Conforti, Marianna De Santis, Marco Di Summa, Francesco Rinaldi
Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective. 4OR 19 (4) (2021)
Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang
Split Cuts in the Plane. SIAM J. Optim. 31 (1) (2021)
Christoph Hertrich, Amitabh Basu, Marco Di Summa, Martin Skutella
Towards Lower Bounds on the Depth of ReLU Neural Networks. NeurIPS (2021)
Manuel Aprile, Michele Conforti, Marco Di Summa
Binary extended formulations and sequential convexification. CoRR (2021)
Amitabh Basu, Michele Conforti, Marco Di Summa
An extreme function which is nonnegative and discontinuous everywhere. Math. Program. 179 (1) (2020)
Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang
Complexity of branch-and-bound and cutting planes in mixed-integer optimization - II. CoRR (2020)
Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang
Complexity of cutting planes and branch-and-bound in mixed-integer optimization. CoRR (2020)
Michele Conforti, Marco Di Summa, Yuri Faenza
Balas formulation for the union of polytopes is optimal. Math. Program. 180 (1) (2020)
Marco Di Summa
Piecewise smooth extreme functions are piecewise linear. Math. Program. 179 (1) (2020)
Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat
The Structure of the Infinite Models in Integer Programming. Math. Oper. Res. 44 (4) (2019)
Amitabh Basu, Michele Conforti, Marco Di Summa, Giacomo Zambelli
Optimal Cutting Planes from the Group Relaxations. Math. Oper. Res. 44 (4) (2019)
Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat
Extreme functions with an arbitrary number of slopes. Math. Program. 172 (1-2) (2018)
Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat
The Structure of the Infinite Models in Integer Programming. IPCO (2017)
Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat
Extreme Functions with an Arbitrary Number of Slopes. IPCO (2016)
Michele Conforti, Marco Di Summa
Maximal S-Free Convex Sets and the Helly Number. SIAM J. Discret. Math. 30 (4) (2016)
Amitabh Basu, Michele Conforti, Marco Di Summa
A geometric approach to cut-generating functions. Math. Program. 151 (1) (2015)
Marco Di Summa, David Pritchard, Laura Sanità
Finding the closest ultrametric. Discret. Appl. Math. 180 (2015)
Marco Di Summa, Friedrich Eisenbrand, Yuri Faenza, Carsten Moldenhauer
On largest volume simplices and sub-determinants. SODA (2015)
Marco Di Summa
A short convex-hull proof for the all-different system with the inclusion property. Oper. Res. Lett. 43 (1) (2015)
Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza, Roland Grappe
Reverse Chvátal-Gomory Rank. SIAM J. Discret. Math. 29 (1) (2015)
Daniele Catanzaro, Roberto Aringhieri, Marco Di Summa, Raffaele Pesenti
A branch-price-and-cut algorithm for the minimum evolution problem. Eur. J. Oper. Res. 244 (3) (2015)
Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza
Reverse split rank. Math. Program. 154 (1-2) (2015)
Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza
Reverse Split Rank. CoRR (2014)
Marco Di Summa, Friedrich Eisenbrand, Yuri Faenza, Carsten Moldenhauer
On largest volume simplices and sub-determinants. CoRR (2014)
Nicolas Bonifas, Marco Di Summa, Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier
On Sub-determinants and the Diameter of Polyhedra. Discret. Comput. Geom. 52 (1) (2014)
Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza
Reverse Split Rank. IPCO (2014)
Gennadiy Averkov, Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza
On the Convergence of the Affine Hull of the Chvátal-Gomory Closures. SIAM J. Discret. Math. 27 (3) (2013)
Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza, Roland Grappe
Reverse Chvátal-Gomory Rank. IPCO (2013)
Bernardetta Addis, Marco Di Summa, Andrea Grosso
Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth. Discret. Appl. Math. 161 (16-17) (2013)
Nicolas Bonifas, Marco Di Summa, Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier
On sub-determinants and the diameter of polyhedra. SCG (2012)
Marco Di Summa, Andrea Grosso, Marco Locatelli
Branch and cut algorithms for detecting critical nodes in undirected graphs. Comput. Optim. Appl. 53 (3) (2012)
Marco Di Summa, Laurence A. Wolsey
Mixing Sets Linked by Bidirected Paths. SIAM J. Optim. 21 (4) (2011)
Marco Di Summa, Laurence A. Wolsey
Erratum: Lot-Sizing with Stock Upper Bounds and Fixed Charges. SIAM J. Discret. Math. 25 (2) (2011)
Marco Di Summa, Andrea Grosso, Marco Locatelli
Complexity of the critical node problem over trees. Comput. Oper. Res. 38 (12) (2011)
Roberto Aringhieri, Daniele Catanzaro, Marco Di Summa
Optimal solutions for the balanced minimum evolution problem. Comput. Oper. Res. 38 (12) (2011)
Nicolas Bonifas, Marco Di Summa, Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier
On sub-determinants and the diameter of polyhedra CoRR (2011)
Marco Di Summa
On a class of mixed-integer sets with a single integer variable. Oper. Res. Lett. 38 (6) (2010)
Marco Di Summa, Laurence A. Wolsey
Lot-Sizing with Stock Upper Bounds and Fixed Charges. SIAM J. Discret. Math. 24 (3) (2010)
Michele Conforti, Marco Di Summa, Friedrich Eisenbrand, Laurence A. Wolsey
Network Formulations of Mixed-Integer Programs. Math. Oper. Res. 34 (1) (2009)
Marco Di Summa, Laurence A. Wolsey
Lot-sizing on a tree. Oper. Res. Lett. 36 (1) (2008)
Michele Conforti, Marco Di Summa, Laurence A. Wolsey
The Mixing Set with Divisible Capacities. IPCO (2008)
Michele Conforti, Marco Di Summa, Laurence A. Wolsey
The Mixing Set with Flows. SIAM J. Discret. Math. 21 (2) (2007)
Michele Conforti, Marco Di Summa, Laurence A. Wolsey
The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows. IPCO (2007)
Michele Conforti, Marco Di Summa, Giacomo Zambelli
Minimally Infeasible Set-Partitioning Problems with Balanced Constraints. Math. Oper. Res. 32 (3) (2007)