Marco Di Summa

Research and Publications

Research interests

• Integer and mixed-integer linear programming
• Polyhedral combinatorics
• Combinatorial optimization

Publications

• A. Basu, M. Conforti, M. Di Summa, H. Jiang, Complexity of branch-and-bound and cutting planes in mixed-integer optimization - II, Combinatorica (published online).
  [Download | Published version]
• Previous version: A. Basu, M. Conforti, M. Di Summa, H. Jiang, Complexity of branch-and-bound and cutting planes in mixed-integer optimization - II, Proceedings of the XXII International Conference on Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science 12707, pp. 383-398, Springer-Verlag (2021).
  [Published version].
• M. Di Summa, S. M. O. Faruk, Critical node/edge detection problems on trees, 4OR (published online).
  [Published version]
• A. Basu, M. Conforti, M. Di Summa, H. Jiang, Complexity of branch-and-bound and cutting planes in mixed-integer optimization, Mathematical Programming (published online).
  [Download | Published version]
• A. Basu, M. Conforti, M. Di Summa, H. Jiang, Split cuts in the plane, SIAM Journal on Optimization 31, pp. 331-347 (2021).
  [Download | Published version]
• C. Hertrich, A. Basu, M. Di Summa, M. Skutella, Towards lower bounds on the depth of ReLU neural networks, Advances in Neural Information Processing Systems 5 (Proceedings of NeurIPS 2021), pp. 3336-3348 (2021).
  [Download | Published version]
• M. Conforti, M. De Santis, M. Di Summa, F. Rinaldi, Scanning integer points with lex-cuts: A finite cutting plane algorithm for integer programming with linear objective, 4OR 19, pp. 531-548 (2021).
  [Download | Published version]
• M. Di Summa, Piecewise smooth extreme functions are piecewise linear, Mathematical Programming 179, pp. 265-293 (2020).
  [Download | Published version]
• A. Basu, M. Conforti, M. Di Summa, An extreme function which is nonnegative and discontinuous everywhere, Mathematical Programming 179, pp. 447-453 (2020).
  [Download | Published version]
• M. Conforti, M. Di Summa, Y. Faenza, Balas formulation for the union of polytopes is optimal, Mathematical Programming 180, pp.311-326 (2020).
  [Download | Published version]
• A. Basu, M. Conforti, M. Di Summa, G. Zambelli, Optimal cutting planes from the group relaxations, Mathematics of Operations Research 44, pp. 1208-1220 (2019).
  [Download | Published version]
• A. Basu, M. Conforti, M. Di Summa, J. Paat, The structure of the infinite models in integer programming, Mathematics of Operations Research 44, pp. 1412-1430 (2019).
  [Download | Published version]
• Previous version: A. Basu, M. Conforti, M. Di Summa, J. Paat, The structure of the infinite models in integer programming, Proceedings of the XIX International Conference on Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science 10328, pp. 63-74, Springer-Verlag (2017).
  [Published version].
• A. Basu, M. Conforti, M. Di Summa, J. Paat, Extreme functions with an arbitrary number of slopes, Mathematical Programming 172, pp. 303-327 (2018).
  [Download | Published version]
• Previous version: A. Basu, M. Conforti, M. Di Summa, J. Paat, Extreme functions with an arbitrary number of slopes, Proceedings of the XVIII International Conference on Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science 9682, pp. 190-201, Springer-Verlag (2016).
  [Published version].
• M. Conforti, M. Di Summa, Maximal S-free convex sets and the Helly number, SIAM Journal on Discrete Mathematics 30, pp. 2206-2216 (2016).
  [Download | Published version]
• M. Di Summa, A. Lucchini, The swap graph of the finite soluble groups, Journal of Algebraic Combinatorics 44, pp. 447-454 (2016).
  [Download | Published version]
• A. Basu, M. Conforti, M. Di Summa, A geometric approach to cut-generating functions, Mathematical Programming 151, pp. 153-189 (2015).
  [Download | Published version]
• M. Di Summa, F. Eisenbrand, Y. Faenza, C. Moldenhauer, On largest volume simplices and sub-determinants, Proceedings of the XXVI Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), pp. 315-323 (2015).
  [Download | Published version]
• M. Di Summa, A short convex hull proof for the all-different system with the inclusion property, Operations Research Letters 43, pp.69-73 (2015)
  [Download | Published version].
• D. Catanzaro, R. Aringhieri, M. Di Summa, R. Pesenti, A branch-price-and-cut algorithm for the Minimum Evolution Problem, European Journal of Operational Research 244, pp. 753-765 (2015).
  [Published version]
• M. Conforti, A. Del Pia, M. Di Summa, Y. Faenza, Reverse split rank, Mathematical Programming 154, pp. 273-303 (2015).
  [Download | Published version]
  • Previous version: M. Conforti, A. Del Pia, M. Di Summa, Y. Faenza, Reverse split rank, Proceedings of the XVII International Conference on Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science 8494, pp. 234-248, Springer-Verlag (2014).
• M. Conforti, A. Del Pia, M. Di Summa, Y. Faenza, R. Grappe, Reverse Chvátal-Gomory rank, SIAM Journal on Discrete Mathematics 29, pp. 166-181 (2015).
  [Download | Published version]
  • Previous version: M. Conforti, A. Del Pia, M. Di Summa, Y. Faenza, R. Grappe, Reverse Chvátal-Gomory rank, in M. Goemans, J. Correa (Eds.), Proceedings of the XVI International Conference on Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science 7801, pp. 133-144, Springer-Verlag (2013).
    [Published version]
• M. Di Summa, D. Pritchard, L. Sanità, Finding the closest ultrametric, Discrete Applied Mathematics 180, pp. 70-80 (2015).
  [Download | Published version]
• N. Bonifas, M. Di Summa, F. Eisenbrand, N. Hähnle, M. Niemeier, On sub-determinants and the diameter of polyhedra, Discrete & Computational Geometry 52, pp. 102-115 (2014).
  [Download | Published version]
  • Previous version: N. Bonifas, M. Di Summa, F. Eisenbrand, N. Hähnle, M. Niemeier, On sub-determinants and the diameter of polyhedra, in T. K. Dey, S. Whitesides (Eds.), Proceedings of the XXVIII Symposium on Computational Geometry (SoCG), pp. 357-362, ACM (2012).
    [Download | Published version]
• B. Addis, M. Di Summa, A. Grosso, Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth, Discrete Applied Matehmatics 161, pp. 2349-2360 (2013).
  [Published version]
• G. Averkov, M. Conforti, A. Del Pia, M. Di Summa, Y. Faenza, On the convergence of the affine hull of the Chvátal-Gomory closures, SIAM Journal on Discrete Mathematics 27, pp. 1492-1502 (2013).
  [Download | Published version]
• M. Di Summa, A. Grosso, M. Locatelli, Branch and cut algorithms for detecting critical nodes in undirected graphs, Computational Optimization and Applications 53, pp. 649-680 (2012).
  [Download | Published version]
• M. Di Summa, L. A. Wolsey, Mixing sets linked by bidirected paths, SIAM Journal on Optimization 21, pp. 1594-1613 (2011).
  [Download | Published version]
• M. Di Summa, A. Grosso, M. Locatelli, Complexity of the critical node problem over trees, Computers & Operations Research 38, pp. 1766-1774 (2011).
  [Download | Published version]
• R. Aringhieri, D. Catanzaro, M. Di Summa, Optimal solutions for the Balanced Minimum Evolution Problem, Computers & Operations Research 38, pp. 1845-1854 (2011).
  [Download | Published version]
• M. Di Summa, On a class of mixed-integer sets with a single integer variable, Operations Research Letters 38, pp. 556-558 (2010).
  [Download | Published version]
• M. Di Summa, L. A. Wolsey, Lot-sizing with stock upper bounds and fixed charges, SIAM Journal on Discrete Mathematics 24, pp. 853-875 (2010).
  [Download | Published version]
• M. Conforti, M. Di Summa, F. Eisenbrand, L. A. Wolsey, Network formulations of mixed-integer programs, Mathematics of Operations Research 34, pp. 194-209 (2009).
  [Download | Published version]
• M. Di Summa, L. A. Wolsey, Lot-sizing on a tree, Operations Research Letters 36, pp. 7-13 (2008).
  [Download | Published version]
• M. Conforti, M. Di Summa, L. A. Wolsey, The mixing set with divisible capacities, in A. Lodi, A. Panconesi, G. Rinaldi (Eds.), Proceedings of the XIII International Conference on Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science 5035, pp. 435-449, Springer-Verlag (2008).
  [Download | Published version]
• M. Di Summa, Formulations of mixed-integer sets defined by totally unimodular constraint matrices, Ph.D. thesis, Università degli Studi di Padova, Italy (2008).
  [Download]
• M. Conforti, M. Di Summa, G. Zambelli, Minimally infeasible set partitioning problems with balanced constraints, Mathematics of Operations Research 32, pp. 497-507 (2007).
  [Download | Published version]
• M. Conforti, M. Di Summa, L. A. Wolsey, The mixing set with flows, SIAM Journal on Discrete Mathematics 21, pp. 396-407 (2007).
  [Download | Published version]
• M. Conforti, M. Di Summa, L. A. Wolsey, The intersection of continuous mixing polyhedra and the continuous mixing polyhedron with flows, in M. Fischetti, D.P. Williamson (Eds.), Proceedings of the XII International Conference on Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science 4513, pp. 352-366, Springer-Verlag (2007).
  [Download | Published version]