Marco Di Summa

发表

Laurence A. Wolsey, Marco Di Summa, L. Wolsey, 2011, SIAM J. Optim..

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

Marco Di Summa, Bernardetta Addis, Andrea Grosso, 2013, Discret. Appl. Math..

Extreme functions with an arbitrary number of slopes

Marco Di Summa, Michele Conforti, Amitabh Basu, 2016, IPCO.

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

Laurence A. Wolsey, Marco Di Summa, Michele Conforti, 2007, IPCO.

Minimally Infeasible Set-Partitioning Problems with Balanced Constraints

Marco Di Summa, Michele Conforti, Giacomo Zambelli, 2007, Math. Oper. Res..

Reverse Chvátal-Gomory Rank

Marco Di Summa, Michele Conforti, Roland Grappe, 2013, SIAM J. Discret. Math..

The Structure of the Infinite Models in Integer Programming

Marco Di Summa, Michele Conforti, Amitabh Basu, 2019, Math. Oper. Res..

Finding the closest ultrametric

Marco Di Summa, David Pritchard, Laura Sanità, 2015, Discret. Appl. Math..

The Structure of the Infinite Models in Integer Programming

Marco Di Summa, Michele Conforti, Amitabh Basu, 2016, IPCO.

On largest volume simplices and sub-determinants

Friedrich Eisenbrand, Marco Di Summa, Carsten Moldenhauer, 2014, SODA.

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

Marco Di Summa, 2015, Oper. Res. Lett..

Maximal S-Free Convex Sets and the Helly Number

Marco Di Summa, Michele Conforti, 2016, SIAM J. Discret. Math..

Reverse Chvátal-Gomory Rank

Marco Di Summa, Michele Conforti, Roland Grappe, 2015, SIAM J. Discret. Math..

Complexity of the critical node problem over trees

Marco Di Summa, Andrea Grosso, Marco Locatelli, 2011, Comput. Oper. Res..

Poliedri di set Partitioning per matrici bilanciate

Marco Di Summa, 2004 .

Balas formulation for the union of polytopes is optimal

Marco Di Summa, Michele Conforti, Yuri Faenza, 2020, Math. Program..

On Sub-determinants and the Diameter of Polyhedra

Friedrich Eisenbrand, Marco Di Summa, Nicolai Hähnle, 2011, SoCG '12.

Extreme functions with an arbitrary number of slopes

Marco Di Summa, Michele Conforti, Amitabh Basu, 2018, Math. Program..

A geometric approach to cut-generating functions

Marco Di Summa, Michele Conforti, Amitabh Basu, 2015, Mathematical Programming.

Network Formulations of Mixed-Integer Programs

Laurence A. Wolsey, Friedrich Eisenbrand, Marco Di Summa, 2006, Math. Oper. Res..

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

Marco Di Summa, M. D. Summa, 2010, Oper. Res. Lett..

Reverse split rank

Marco Di Summa, Michele Conforti, Alberto Del Pia, 2014, IPCO.

Lot-Sizing on a Tree

Laurence A. Wolsey, Marco Di Summa, L. Wolsey, 2006, Oper. Res. Lett..

The Mixing Set with Divisible Capacities

Laurence A. Wolsey, Marco Di Summa, Michele Conforti, 2008, IPCO.

Optimal solutions for the balanced minimum evolution problem

Marco Di Summa, Roberto Aringhieri, Daniele Catanzaro, 2011, Comput. Oper. Res..

The Mixing Set with Flows

Laurence A. Wolsey, Marco Di Summa, Michele Conforti, 2007, SIAM J. Discret. Math..

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

Marco Di Summa, Michele Conforti, Alberto Del Pia, 2012, SIAM J. Discret. Math..

On Sub-determinants and the Diameter of Polyhedra

Friedrich Eisenbrand, Marco Di Summa, Nicolai Hähnle, 2014, Discret. Comput. Geom..

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

Laurence A. Wolsey, Marco Di Summa, 2011, SIAM J. Discret. Math..

Optimal Cutting Planes from the Group Relaxations

Marco Di Summa, Michele Conforti, Giacomo Zambelli, 2017, Math. Oper. Res..

Piecewise smooth extreme functions are piecewise linear

Marco Di Summa, M. D. Summa, 2020, Math. Program..

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

Marco Di Summa, Roberto Aringhieri, Raffaele Pesenti, 2015, Eur. J. Oper. Res..

Lot-Sizing with Stock Upper Bounds and Fixed Charges

Laurence A. Wolsey, Marco Di Summa, L. Wolsey, 2010, SIAM J. Discret. Math..

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

Marco Di Summa, Michele Conforti, Amitabh Basu, 2020, ArXiv.

Branch and cut algorithms for detecting critical nodes in undirected graphs

Marco Di Summa, Andrea Grosso, Marco Locatelli, 2012, Computational Optimization and Applications.

An extreme function which is nonnegative and discontinuous everywhere

Marco Di Summa, Michele Conforti, Amitabh Basu, 2018, Math. Program..

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

Marco Di Summa, Michele Conforti, Amitabh Basu, 2020, ArXiv.

Reverse split rank

Marco Di Summa, Michele Conforti, Alberto Del Pia, 2015, Math. Program..

Split Cuts in the Plane

Marco Di Summa, Michele Conforti, Amitabh Basu, 2021, SIAM J. Optim..

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

Marco Di Summa, Michele Conforti, Amitabh Basu, 2021, IPCO.

Binary extended formulations and sequential convexification pdf

Marco Di Summa, Michele Conforti, Manuel Aprile, 2021, ArXiv.

Towards Lower Bounds on the Depth of ReLU Neural Networks pdf

Martin Skutella, Marco Di Summa, Amitabh Basu, 2021, ArXiv.

Formulations of mixed-integer sets defined by totally unimodular constraint matrices

Marco Di Summa, 2008 .

The convex hull of the all-different system with the inclusion property: A simple proof

Marco Di Summa, 2013 .