Giacomo Zambelli

Comb., December, 2024

Arc Connectivity and Submodular Flows in Digraphs.

[BibT_eX]

[DOI]

Ahmad Abdi

Comb., October, 2024

2022

Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2020.

[BibT_eX]

[DOI]

Daniel Bienstock

Math. Program., 2022

On finding exact solutions of linear programs in the oracle model.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

Geometric Rescaling Algorithms for Submodular Function Minimization.

[BibT_eX]

[DOI]

Dan Dadush

Math. Oper. Res., 2021

2020

Rescaling Algorithms for Linear Conic Feasibility.

[BibT_eX]

[DOI]

Math. Oper. Res., 2020

2019

Optimal Cutting Planes from the Group Relaxations.

[BibT_eX]

[DOI]

Math. Oper. Res., 2019

2018

On matrices with the Edmonds-Johnson property arising from bidirected graphs.

[BibT_eX]

[DOI]

Alberto Del Pia

Antoine Musitelli

J. Comb. Theory B, 2018

2016

Rescaling Algorithms for Linear Programming - Part I: Conic feasibility.

[BibT_eX]

[DOI]

CoRR, 2016

Rescaled Coordinate Descent Methods for Linear Programming.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2016

2014

A polynomial projection-type algorithm for linear programming.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2014

2013

Cutting planes from two-term disjunctions.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2013

Unique lifting of integer variables in minimal inequalities.

[BibT_eX]

[DOI]

Math. Program., 2013

2012

A counterexample to a conjecture of Gomory and Johnson.

[BibT_eX]

[DOI]

Math. Program., 2012

2011

A Geometric Perspective on Lifting.

[BibT_eX]

[DOI]

Oper. Res., 2011

2010

Minimal Inequalities for an Infinite Relaxation of Integer Programs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Equivalence between intersection cuts and the corner polyhedron.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2010

Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs.

[BibT_eX]

[DOI]

Laurence A. Wolsey

Math. Oper. Res., 2010

Maximal Lattice-Free Convex Sets in Linear Subspaces.

[BibT_eX]

[DOI]

Math. Oper. Res., 2010

Extended formulations in combinatorial optimization.

[BibT_eX]

[DOI]

4OR, 2010

On Lifting Integer Variables in Minimal Inequalities.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Polyhedral Approaches to Mixed Integer Linear Programming.

[BibT_eX]

[DOI]

Proceedings of the 50 Years of Integer Programming 1958-2008, 2010

2009

Half-Integral Vertex Covers on Bipartite Bidirected Graphs: Total Dual Integrality and Cut-Rank.

[BibT_eX]

[DOI]

Alberto Del Pia

SIAM J. Discret. Math., 2009

On degenerate multi-row Gomory cuts.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2009

The mixing set with divisible capacities: A simple approach.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2009

2007

Colorings of k-balanced matrices and integer decomposition property of related polyhedra.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2007

Minimally Infeasible Set-Partitioning Problems with Balanced Constraints.

[BibT_eX]

[DOI]

Marco Di Summa

Math. Oper. Res., 2007

Mixed-Integer Vertex Covers on Bipartite Graphs.

[BibT_eX]

[DOI]

Bert Gerards

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2006

Odd Hole Recognition in Graphs of Bounded Clique Size.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2006

Recognizing Balanceable Matrices.

[BibT_eX]

[DOI]

Math. Program., 2006

Decomposing Berge Graphs Containing No Proper Wheel, Long Prism Or Their Complements.

[BibT_eX]

[DOI]

Comb., 2006

2005

A polynomial recognition algorithm for balanced matrices.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2005

Disjoint paths in arborescences.

[BibT_eX]

[DOI]

Livio Colussi

Discret. Math., 2005

2004

Bicolorings and Equitable Bicolorings of Matrices.

[BibT_eX]

[DOI]