Giacomo Zambelli

39 papers A* 2B 4Journal 31
YearRankTypeTitle / Venue / Authors
2024 J jnl
Arc Connectivity and Submodular Flows in Digraphs.
Comb.
Ahmad Abdi, Gérard Cornuéjols, Giacomo Zambelli
2024 J jnl
Erratum to: Arc Connectivity and Submodular Flows in Digraphs.
Comb.
Ahmad Abdi, Gérard Cornuéjols, Giacomo Zambelli
2022 A* conf
On finding exact solutions of linear programs in the oracle model.
SODA
Daniel Dadush, László A. Végh, Giacomo Zambelli
2022 J jnl
Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2020.
Math. Program.
Daniel Bienstock, Giacomo Zambelli
2021 J jnl
Geometric Rescaling Algorithms for Submodular Function Minimization.
Math. Oper. Res.
Dan Dadush, László A. Végh, Giacomo Zambelli
2020 B ed.
Integer Programming and Combinatorial Optimization - 21st International Conference, IPCO 2020, London, UK, June 8-10, 2020, Proceedings
IPCO
Daniel Bienstock, Giacomo Zambelli
2020 J jnl
Rescaling Algorithms for Linear Conic Feasibility.
Math. Oper. Res.
Daniel Dadush, László A. Végh, Giacomo Zambelli
2019 J jnl
Optimal Cutting Planes from the Group Relaxations.
Math. Oper. Res.
Amitabh Basu, Michele Conforti, Marco Di Summa, Giacomo Zambelli
2018 A* conf
Geometric Rescaling Algorithms for Submodular Function Minimization.
SODA
Daniel Dadush, László A. Végh, Giacomo Zambelli
2018 J jnl
On matrices with the Edmonds-Johnson property arising from bidirected graphs.
J. Comb. Theory B
Alberto Del Pia, Antoine Musitelli, Giacomo Zambelli
2017 J jnl
Geometric Rescaling Algorithms for Submodular Function Minimization.
CoRR
Daniel Dadush, László A. Végh, Giacomo Zambelli
2016 B conf
Rescaled Coordinate Descent Methods for Linear Programming.
IPCO
Daniel Dadush, László A. Végh, Giacomo Zambelli
2016 J jnl
Rescaling Algorithms for Linear Programming - Part I: Conic feasibility.
CoRR
Daniel Dadush, László A. Végh, Giacomo Zambelli
2014 J jnl
A polynomial projection-type algorithm for linear programming.
Oper. Res. Lett.
László A. Végh, Giacomo Zambelli
2013 J jnl
A polynomial projection-type algorithm for linear programming.
CoRR
László A. Végh, Giacomo Zambelli
2013 J jnl
Cutting planes from two-term disjunctions.
Oper. Res. Lett.
Pierre Bonami, Michele Conforti, Gérard Cornuéjols, Marco Molinaro, Giacomo Zambelli
2013 J jnl
Extended formulations in combinatorial optimization.
Ann. Oper. Res.
Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2013 J jnl
Unique lifting of integer variables in minimal inequalities.
Math. Program.
Amitabh Basu, Manoel B. Campêlo, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2012 J jnl
A counterexample to a conjecture of Gomory and Johnson.
Math. Program.
Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2011 J jnl
A Geometric Perspective on Lifting.
Oper. Res.
Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2010 J jnl
Equivalence between intersection cuts and the corner polyhedron.
Oper. Res. Lett.
Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2010 J jnl
Extended formulations in combinatorial optimization.
4OR
Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2010 J jnl
Maximal Lattice-Free Convex Sets in Linear Subspaces.
Math. Oper. Res.
Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2010 J jnl
Minimal Inequalities for an Infinite Relaxation of Integer Programs.
SIAM J. Discret. Math.
Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2010 B conf
On Lifting Integer Variables in Minimal Inequalities.
IPCO
Amitabh Basu, Manoel B. Campêlo, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2010 — ch.
Polyhedral Approaches to Mixed Integer Linear Programming.
50 Years of Integer Programming
Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2010 J jnl
Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs.
Math. Oper. Res.
Michele Conforti, Laurence A. Wolsey, Giacomo Zambelli
2009 J jnl
Half-Integral Vertex Covers on Bipartite Bidirected Graphs: Total Dual Integrality and Cut-Rank.
SIAM J. Discret. Math.
Alberto Del Pia, Giacomo Zambelli
2009 J jnl
On degenerate multi-row Gomory cuts.
Oper. Res. Lett.
Giacomo Zambelli
2009 J jnl
The mixing set with divisible capacities: A simple approach.
Oper. Res. Lett.
Michele Conforti, Giacomo Zambelli
2007 J jnl
Colorings of k-balanced matrices and integer decomposition property of related polyhedra.
Oper. Res. Lett.
Giacomo Zambelli
2007 J jnl
Minimally Infeasible Set-Partitioning Problems with Balanced Constraints.
Math. Oper. Res.
Michele Conforti, Marco Di Summa, Giacomo Zambelli
2007 B conf
Mixed-Integer Vertex Covers on Bipartite Graphs.
IPCO
Michele Conforti, Bert Gerards, Giacomo Zambelli
2006 J jnl
Decomposing Berge Graphs Containing No Proper Wheel, Long Prism Or Their Complements.
Comb.
Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
2006 J jnl
Odd Hole Recognition in Graphs of Bounded Clique Size.
SIAM J. Discret. Math.
Michele Conforti, Gérard Cornuéjols, Xinming Liu, Kristina Vuskovic, Giacomo Zambelli
2006 J jnl
Recognizing Balanceable Matrices.
Math. Program.
Michele Conforti, Giacomo Zambelli
2005 J jnl
A polynomial recognition algorithm for balanced matrices.
J. Comb. Theory B
Giacomo Zambelli
2005 J jnl
Disjoint paths in arborescences.
Discret. Math.
Livio Colussi, Michele Conforti, Giacomo Zambelli
2004 — ch.
Bicolorings and Equitable Bicolorings of Matrices.
The Sharpest Cut
Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli