default search action
Giacomo Zambelli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j27]Ahmad Abdi, Gérard Cornuéjols, Giacomo Zambelli:
Arc Connectivity and Submodular Flows in Digraphs. Comb. 44(5): 1069-1090 (2024) - 2022
- [j26]Daniel Bienstock, Giacomo Zambelli:
Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2020. Math. Program. 192(1): 1-2 (2022) - [c5]Daniel Dadush, László A. Végh
, Giacomo Zambelli:
On finding exact solutions of linear programs in the oracle model. SODA 2022: 2700-2722 - 2021
- [j25]Dan Dadush, László A. Végh
Geometric Rescaling Algorithms for Submodular Function Minimization. Math. Oper. Res. 46(3): 1081-1108 (2021) - 2020
- [j24]Daniel Dadush
Rescaling Algorithms for Linear Conic Feasibility. Math. Oper. Res. 45(2): 732-754 (2020) - [e1]Daniel Bienstock, Giacomo Zambelli:
Integer Programming and Combinatorial Optimization - 21st International Conference, IPCO 2020, London, UK, June 8-10, 2020, Proceedings. Lecture Notes in Computer Science 12125, Springer 2020, ISBN 978-3-030-45770-9 [contents]
2010 – 2019
- 2019
- [j23]Amitabh Basu
Optimal Cutting Planes from the Group Relaxations. Math. Oper. Res. 44(4): 1208-1220 (2019) - 2018
- [j22]Alberto Del Pia
On matrices with the Edmonds-Johnson property arising from bidirected graphs. J. Comb. Theory B 130: 49-91 (2018) - [c4]Daniel Dadush, László A. Végh
Geometric Rescaling Algorithms for Submodular Function Minimization. SODA 2018: 832-848 - 2017
- [i3]Daniel Dadush, László A. Végh, Giacomo Zambelli:
Geometric Rescaling Algorithms for Submodular Function Minimization. CoRR abs/1707.05065 (2017) - 2016
- [c3]Daniel Dadush, László A. Végh
Rescaled Coordinate Descent Methods for Linear Programming. IPCO 2016: 26-37 - [i2]Daniel Dadush, László A. Végh, Giacomo Zambelli:
Rescaling Algorithms for Linear Programming - Part I: Conic feasibility. CoRR abs/1611.06427 (2016) - 2014
- [j21]László A. Végh
A polynomial projection-type algorithm for linear programming. Oper. Res. Lett. 42(1): 91-96 (2014) - 2013
- [j20]Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Extended formulations in combinatorial optimization. Ann. Oper. Res. 204(1): 97-143 (2013) - [j19]Amitabh Basu
Unique lifting of integer variables in minimal inequalities. Math. Program. 141(1-2): 561-576 (2013) - [j18]Pierre Bonami, Michele Conforti, Gérard Cornuéjols, Marco Molinaro, Giacomo Zambelli:
Cutting planes from two-term disjunctions. Oper. Res. Lett. 41(5): 442-444 (2013) - [i1]László A. Végh, Giacomo Zambelli:
A polynomial projection-type algorithm for linear programming. CoRR abs/1307.4334 (2013) - 2012
- [j17]Amitabh Basu
A counterexample to a conjecture of Gomory and Johnson. Math. Program. 133(1-2): 25-38 (2012) - 2011
- [j16]Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
A Geometric Perspective on Lifting. Oper. Res. 59(3): 569-577 (2011) - 2010
- [j15]Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Extended formulations in combinatorial optimization. 4OR 8(1): 1-48 (2010) - [j14]Michele Conforti, Laurence A. Wolsey, Giacomo Zambelli:
Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs. Math. Oper. Res. 35(3): 603-623 (2010) - [j13]Amitabh Basu
Maximal Lattice-Free Convex Sets in Linear Subspaces. Math. Oper. Res. 35(3): 704-720 (2010) - [j12]Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Equivalence between intersection cuts and the corner polyhedron. Oper. Res. Lett. 38(3): 153-155 (2010) - [j11]Amitabh Basu
Minimal Inequalities for an Infinite Relaxation of Integer Programs. SIAM J. Discret. Math. 24(1): 158-168 (2010) - [c2]Amitabh Basu
On Lifting Integer Variables in Minimal Inequalities. IPCO 2010: 85-95 - [p2]Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Polyhedral Approaches to Mixed Integer Linear Programming. 50 Years of Integer Programming 2010: 343-385
2000 – 2009
- 2009
- [j10]Giacomo Zambelli:
On degenerate multi-row Gomory cuts. Oper. Res. Lett. 37(1): 21-22 (2009) - [j9]Michele Conforti, Giacomo Zambelli:
The mixing set with divisible capacities: A simple approach. Oper. Res. Lett. 37(6): 379-383 (2009) - [j8]Alberto Del Pia
Half-Integral Vertex Covers on Bipartite Bidirected Graphs: Total Dual Integrality and Cut-Rank. SIAM J. Discret. Math. 23(3): 1281-1296 (2009) - 2007
- [j7]Michele Conforti, Marco Di Summa, Giacomo Zambelli:
Minimally Infeasible Set-Partitioning Problems with Balanced Constraints. Math. Oper. Res. 32(3): 497-507 (2007) - [j6]Giacomo Zambelli:
Colorings of k-balanced matrices and integer decomposition property of related polyhedra. Oper. Res. Lett. 35(3): 353-356 (2007) - [c1]Michele Conforti, Bert Gerards, Giacomo Zambelli:
Mixed-Integer Vertex Covers on Bipartite Graphs. IPCO 2007: 324-336 - 2006
- [j5]Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Decomposing Berge Graphs Containing No Proper Wheel, Long Prism Or Their Complements. Comb. 26(5): 533-558 (2006) - [j4]Michele Conforti, Giacomo Zambelli:
Recognizing Balanceable Matrices. Math. Program. 105(2-3): 161-179 (2006) - [j3]Michele Conforti, Gérard Cornuéjols, Xinming Liu, Kristina Vuskovic, Giacomo Zambelli:
Odd Hole Recognition in Graphs of Bounded Clique Size. SIAM J. Discret. Math. 20(1): 42-48 (2006) - 2005
- [j2]Livio Colussi, Michele Conforti, Giacomo Zambelli:
Disjoint paths in arborescences. Discret. Math. 292(1-3): 187-191 (2005) - [j1]Giacomo Zambelli:
A polynomial recognition algorithm for balanced matrices. J. Comb. Theory B 95(1): 49-67 (2005) - 2004
- [p1]Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Bicolorings and Equitable Bicolorings of Matrices. The Sharpest Cut 2004: 33-37
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-10-16 20:34 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: