default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarco Di Summa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j35]Manuel Aprile
, Michele Conforti, Marco Di Summa:
Binary Extended Formulations and Sequential Convexification. Math. Oper. Res. 49(3): 1566-1581 (2024)- [j34]Manuel Aprile, Gennadiy Averkov, Marco Di Summa, Christopher Hojny:
The role of rationality in integer-programming relaxations. Math. Program. 205(1): 745-771 (2024) - 2023
- [j33]Marco Di Summa, Syed Md Omar Faruk:
Critical node/edge detection problems on trees. 4OR 21(3): 439-455 (2023) - [j32]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): 787-810 (2023) - [j31]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): 997-1029 (2023) - 2022
- [j30]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): 971-996 (2022) - [i8]Manuel Aprile, Gennadiy Averkov, Marco Di Summa, Christopher Hojny:
The role of rationality in integer-programming relaxations. CoRR abs/2206.12253 (2022) - 2021
- [j29]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): 531-548 (2021) - [j28]Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang:
Split Cuts in the Plane. SIAM J. Optim. 31(1): 331-347 (2021) - [c10]Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang:
Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II. IPCO 2021: 383-398 - [c9]Christoph Hertrich, Amitabh Basu, Marco Di Summa, Martin Skutella:
Towards Lower Bounds on the Depth of ReLU Neural Networks. NeurIPS 2021: 3336-3348 - [i7]Christoph Hertrich, Amitabh Basu, Marco Di Summa, Martin Skutella:
Towards Lower Bounds on the Depth of ReLU Neural Networks. CoRR abs/2105.14835 (2021) - [i6]Manuel Aprile, Michele Conforti, Marco Di Summa:
Binary extended formulations and sequential convexification. CoRR abs/2106.00354 (2021) - 2020
- [j27]Marco Di Summa:
Piecewise smooth extreme functions are piecewise linear. Math. Program. 179(1): 265-293 (2020) - [j26]Amitabh Basu, Michele Conforti, Marco Di Summa:
An extreme function which is nonnegative and discontinuous everywhere. Math. Program. 179(1): 447-453 (2020) - [j25]Michele Conforti, Marco Di Summa, Yuri Faenza:
Balas formulation for the union of polytopes is optimal. Math. Program. 180(1): 311-326 (2020) - [i5]Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang:
Complexity of cutting planes and branch-and-bound in mixed-integer optimization. CoRR abs/2003.05023 (2020) - [i4]Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang:
Complexity of branch-and-bound and cutting planes in mixed-integer optimization - II. CoRR abs/2011.05474 (2020)
2010 – 2019
- 2019
- [j24]Amitabh Basu, Michele Conforti, Marco Di Summa, Giacomo Zambelli:
Optimal Cutting Planes from the Group Relaxations. Math. Oper. Res. 44(4): 1208-1220 (2019) - [j23]Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat:
The Structure of the Infinite Models in Integer Programming. Math. Oper. Res. 44(4): 1412-1430 (2019) - 2018
- [j22]Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat:
Extreme functions with an arbitrary number of slopes. Math. Program. 172(1-2): 303-327 (2018) - 2017
- [c8]Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat:
The Structure of the Infinite Models in Integer Programming. IPCO 2017: 63-74 - 2016
- [j21]Michele Conforti, Marco Di Summa:
Maximal S-Free Convex Sets and the Helly Number. SIAM J. Discret. Math. 30(4): 2206-2216 (2016) - [c7]Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat:
Extreme Functions with an Arbitrary Number of Slopes. IPCO 2016: 190-201 - 2015
- [j20]Marco Di Summa, David Pritchard, Laura Sanità:
Finding the closest ultrametric. Discret. Appl. Math. 180: 70-80 (2015) - [j19]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): 753-765 (2015) - [j18]Amitabh Basu, Michele Conforti, Marco Di Summa:
A geometric approach to cut-generating functions. Math. Program. 151(1): 153-189 (2015) - [j17]Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza:
Reverse split rank. Math. Program. 154(1-2): 273-303 (2015) - [j16]Marco Di Summa:
A short convex-hull proof for the all-different system with the inclusion property. Oper. Res. Lett. 43(1): 69-73 (2015) - [j15]Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza, Roland Grappe:
Reverse Chvátal-Gomory Rank. SIAM J. Discret. Math. 29(1): 166-181 (2015) - [c6]Marco Di Summa, Friedrich Eisenbrand, Yuri Faenza, Carsten Moldenhauer:
On largest volume simplices and sub-determinants. SODA 2015: 315-323 - 2014
- [j14]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): 102-115 (2014) - [c5]Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza:
Reverse Split Rank. IPCO 2014: 234-248 - [i3]Marco Di Summa, Friedrich Eisenbrand, Yuri Faenza, Carsten Moldenhauer:
On largest volume simplices and sub-determinants. CoRR abs/1406.3512 (2014) - [i2]Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza:
Reverse Split Rank. CoRR abs/1407.2034 (2014) - 2013
- [j13]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): 2349-2360 (2013) - [j12]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): 1492-1502 (2013) - [c4]Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza, Roland Grappe:
Reverse Chvátal-Gomory Rank. IPCO 2013: 133-144 - 2012
- [j11]Marco Di Summa, Andrea Grosso, Marco Locatelli:
Branch and cut algorithms for detecting critical nodes in undirected graphs. Comput. Optim. Appl. 53(3): 649-680 (2012) - [c3]Nicolas Bonifas, Marco Di Summa, Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier:
On sub-determinants and the diameter of polyhedra. SCG 2012: 357-362 - 2011
- [j10]Marco Di Summa, Andrea Grosso, Marco Locatelli:
Complexity of the critical node problem over trees. Comput. Oper. Res. 38(12): 1766-1774 (2011) - [j9]Roberto Aringhieri, Daniele Catanzaro, Marco Di Summa:
Optimal solutions for the balanced minimum evolution problem. Comput. Oper. Res. 38(12): 1845-1854 (2011) - [j8]Marco Di Summa, Laurence A. Wolsey:
Erratum: Lot-Sizing with Stock Upper Bounds and Fixed Charges. SIAM J. Discret. Math. 25(2): 731-732 (2011) - [j7]Marco Di Summa, Laurence A. Wolsey:
Mixing Sets Linked by Bidirected Paths. SIAM J. Optim. 21(4): 1594-1613 (2011) - [i1]Nicolas Bonifas, Marco Di Summa, Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier:
On sub-determinants and the diameter of polyhedra. CoRR abs/1108.4272 (2011) - 2010
- [j6]Marco Di Summa:
On a class of mixed-integer sets with a single integer variable. Oper. Res. Lett. 38(6): 556-558 (2010) - [j5]Marco Di Summa, Laurence A. Wolsey:
Lot-Sizing with Stock Upper Bounds and Fixed Charges. SIAM J. Discret. Math. 24(3): 853-875 (2010)
2000 – 2009
- 2009
- [j4]Michele Conforti, Marco Di Summa, Friedrich Eisenbrand, Laurence A. Wolsey:
Network Formulations of Mixed-Integer Programs. Math. Oper. Res. 34(1): 194-209 (2009) - 2008
- [j3]Marco Di Summa, Laurence A. Wolsey:
Lot-sizing on a tree. Oper. Res. Lett. 36(1): 7-13 (2008) - [c2]Michele Conforti, Marco Di Summa, Laurence A. Wolsey:
The Mixing Set with Divisible Capacities. IPCO 2008: 435-449 - 2007
- [j2]Michele Conforti, Marco Di Summa, Giacomo Zambelli:
Minimally Infeasible Set-Partitioning Problems with Balanced Constraints. Math. Oper. Res. 32(3): 497-507 (2007) - [j1]Michele Conforti, Marco Di Summa, Laurence A. Wolsey:
The Mixing Set with Flows. SIAM J. Discret. Math. 21(2): 396-407 (2007) - [c1]Michele Conforti, Marco Di Summa, Laurence A. Wolsey:
The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows. IPCO 2007: 352-366
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-22 00:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
