Marco Di Summa

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