Gérard Cornuéjols

Siyue Liu

R. Ravi

CoRR, January, 2025

Strongly Connected Orientations and Integer Lattices.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2025

2024

Erratum to: Arc Connectivity and Submodular Flows in Digraphs.

[BibT_eX]

[DOI]

Comb., December, 2024

Arc Connectivity and Submodular Flows in Digraphs.

[BibT_eX]

[DOI]

Comb., October, 2024

Reducing the Chvátal rank through binarization.

[BibT_eX]

[DOI]

Vrishabh Patil

Oper. Res. Lett., 2024

Approximately Packing Dijoins via Nowhere-Zero Flows.

[BibT_eX]

[DOI]

Siyue Liu

R. Ravi

Proceedings of the Integer Programming and Combinatorial Optimization, 2024

2023

On Packing Dijoins in Digraphs and Weighted Digraphs.

[BibT_eX]

[DOI]

Michael Zlatin

SIAM J. Discret. Math., December, 2023

Branch-and-Bound versus Lift-and-Project Relaxations in Combinatorial Optimization.

[BibT_eX]

[DOI]

Yatharth Dubey

CoRR, 2023

2022

On Dyadic Fractional Packings of $T$-Joins.

[BibT_eX]

[DOI]

Zuzanna Palion

SIAM J. Discret. Math., September, 2022

Clean Clutters and Dyadic Fractional Packings.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

Testing idealness in the filter oracle model.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2022

Correction to: Idealness of k-wise intersecting families.

[BibT_eX]

[DOI]

Math. Program., 2022

Clean tangled clutters, simplices, and projective geometries.

[BibT_eX]

[DOI]

Matt Superdock

J. Comb. Theory B, 2022

Total Dual Dyadicness and Dyadic Generating Sets.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2022

2021

Resistant Sets in the Unit Hypercube.

[BibT_eX]

[DOI]

Math. Oper. Res., 2021

A new infinite class of ideal minimally non-packing clutters.

[BibT_eX]

[DOI]

Matt Superdock

Discret. Math., 2021

The max-flow min-cut property and ±1-resistant sets.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

2020

Computational Aspects of Bayesian Solution Estimators in Stochastic Optimization.

[BibT_eX]

[DOI]

Danial Davarnia

Burak Kocuk

INFORMS J. Optim., October, 2020

On the Rational Polytopes with Chvátal Rank 1.

[BibT_eX]

[DOI]

Math. Program., 2020

Cuboids, a class of clutters.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2020

Intersecting Restrictions in Clutters.

[BibT_eX]

[DOI]

Comb., 2020

Idealness of k-wise Intersecting Families.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2020

2019

Idealness and 2-resistant sets.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2019

Identically Self-blocking Clutters.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2019

2018

When the Gomory-Chvátal closure coincides with the integer hull.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2018

Ideal Clutters That Do Not Pack.

[BibT_eX]

[DOI]

Kanstantsin Pashkovich

Math. Oper. Res., 2018

2017

From estimation to optimization via shrinkage.

[BibT_eX]

[DOI]

Danial Davarnia

Oper. Res. Lett., 2017

Optimality certificates for convex minimization and Helly numbers.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2017

2016

Cut-Generating Functions for Integer Variables.

[BibT_eX]

[DOI]

Sercan Yildiz

Math. Oper. Res., 2016

Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2016

On Some Polytopes Contained in the 0, 1 Hypercube that Have a Small Chvátal Rank.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2016

2015

Disjunctive cuts for cross-sections of the second-order cone.

[BibT_eX]

[DOI]

Sercan Yildiz

Oper. Res. Lett., 2015

Sufficiency of cut-generating functions.

[BibT_eX]

[DOI]

Laurence A. Wolsey

Sercan Yildiz

Math. Program., 2015

Special issue of Mathematical Programming, Series B, dedicated to the international symposium on mathematical programming, Pittsburgh, July 2015.

[BibT_eX]

[DOI]

Andrew J. Schaefer

Math. Program., 2015

On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs.

[BibT_eX]

[DOI]

Math. Program., 2015

Cut-Generating Functions and S-Free Sets.

[BibT_eX]

[DOI]

Math. Oper. Res., 2015

2013

Lifting Gomory cuts with bounded variables.

[BibT_eX]

[DOI]

Tamás Kis

Marco Molinaro

Oper. Res. Lett., 2013

Cutting planes from two-term disjunctions.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2013

On the safety of Gomory cut generators.

[BibT_eX]

[DOI]

Math. Program. Comput., 2013

A 3-Slope Theorem for the infinite relaxation in the plane.

[BibT_eX]

[DOI]

Marco Molinaro

Math. Program., 2013

Unique lifting of integer variables in minimal inequalities.

[BibT_eX]

[DOI]

Math. Program., 2013

Combining Lift-and-Project and Reduce-and-Split.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2013

Cut-Generating Functions.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2013

2012

A counterexample to a conjecture of Gomory and Johnson.

[BibT_eX]

[DOI]

Math. Program., 2012

Intersection Cuts with Infinite Split Rank.

[BibT_eX]

[DOI]

Amitabh Basu

Math. Oper. Res., 2012

Unique Minimal Liftings for Simplicial Polytopes.

[BibT_eX]

[DOI]

Amitabh Basu

Matthias Köppe

Math. Oper. Res., 2012

How tight is the corner relaxation? Insights gained from the stable set problem.

[BibT_eX]

[DOI]

Carla Michini

Discret. Optim., 2012

Mixed-integer nonlinear programs featuring "on/off" constraints.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2012

2011

Branching on Split Disjunctions.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - Methods and Applications, 2011

Practical strategies for generating rank-1 split cuts in mixed-integer linear programming.

[BibT_eX]

[DOI]

Math. Program. Comput., 2011

Branching on general disjunctions.

[BibT_eX]

[DOI]

Miroslav Karamanov

Math. Program., 2011

A Geometric Perspective on Lifting.

[BibT_eX]

[DOI]

Oper. Res., 2011

Experiments with Two-Row Cuts from Degenerate Tableaux.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2011

A Probabilistic Analysis of the Strength of the Split and Triangle Closures.

[BibT_eX]

[DOI]

Amitabh Basu

Marco Molinaro

Proceedings of the Integer Programming and Combinatoral Optimization, 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

Maximal Lattice-Free Convex Sets in Linear Subspaces.

[BibT_eX]

[DOI]

Math. Oper. Res., 2010

Mixed Integer NonLinear Programs featuring "On/Off" constraints: convex analysis and applications.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 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

Stable sets, corner polyhedra and the Chvátal closure.

[BibT_eX]

[DOI]

Manoel B. Campêlo

Oper. Res. Lett., 2009

A Feasibility Pump for mixed integer nonlinear programs.

[BibT_eX]

[DOI]

Math. Program., 2009

Minimal Valid Inequalities for Integer Constraints.

[BibT_eX]

[DOI]

Valentin Borozan

Math. Oper. Res., 2009

Lehman matrices.

[BibT_eX]

[DOI]

Levent Tunçel

J. Comb. Theory B, 2009

The Chvátal closure of generalized stable sets in bidirected graphs.

[BibT_eX]

[DOI]

Manoel B. Campêlo

Electron. Notes Discret. Math., 2009

On the relative strength of split, triangle and quadrilateral cuts.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Improved Strategies for Branching on General Disjunctions.

[BibT_eX]

[DOI]

Leo Liberti

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008

Review of combinatorial optimization: packing and covering.

[BibT_eX]

[DOI]

SIGACT News, 2008

A note on the MIR closure.

[BibT_eX]

[DOI]

Pierre Bonami

Oper. Res. Lett., 2008

Valid inequalities for mixed integer linear programs.

[BibT_eX]

[DOI]

Math. Program., 2008

Projected Chvátal-Gomory cuts for mixed integer linear programs.

[BibT_eX]

[DOI]

Math. Program., 2008

An algorithmic framework for convex mixed integer nonlinear programs.

[BibT_eX]

[DOI]

Discret. Optim., 2008

On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007

Revival of the Gomory cuts in the 1990's.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2007

2006

Odd Hole Recognition in Graphs of Bounded Clique Size.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2006

A convex-analysis perspective on disjunctive cuts.

[BibT_eX]

[DOI]

Claude Lemaréchal

Math. Program., 2006

Early Estimates of the Size of Branch-and-Bound Trees.

[BibT_eX]

[DOI]

Miroslav Karamanov

INFORMS J. Comput., 2006

Balanced matrices.

[BibT_eX]

[DOI]

Discret. Math., 2006

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

[BibT_eX]

[DOI]

Comb., 2006

2005

Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts.

[BibT_eX]

[DOI]

Kent Andersen

Manag. Sci., 2005

Recognizing Berge Graphs.

[BibT_eX]

[DOI]

Comb., 2005

2004

Square-free perfect graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2004

Decomposition of odd-hole-free graphs by double star cutsets and 2-joins.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Bicolorings and Equitable Bicolorings of Matrices.

[BibT_eX]

[DOI]

Proceedings of the Sharpest Cut, 2004

2003

Integer programming.

[BibT_eX]

[DOI]

Math. Program., 2003

A class of perfect graphs containing P6.

[BibT_eX]

[DOI]

Xinming Liu

J. Comb. Theory B, 2003

Graphs without odd holes, parachutes or proper wheels: a generalization of Meyniel graphs and of line graphs of bipartite graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2003

K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau.

[BibT_eX]

[DOI]

Dieter Vandenbussche

INFORMS J. Comput., 2003

A Polynomial Algorithm for Recognizing Perfect Graphs.

[BibT_eX]

[DOI]

Xinming Liu

Proceedings of the 44th Symposium on Foundations of Computer Science, 2003

2002

Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2002

A connection between cutting plane theory and the geometry of numbers.

[BibT_eX]

[DOI]

Math. Program., 2002

Even-hole-free graphs part I: Decomposition theorem.

[BibT_eX]

[DOI]

J. Graph Theory, 2002

Even-hole-free graphs part II: Recognition algorithm.

[BibT_eX]

[DOI]

J. Graph Theory, 2002

On dijoins.

[BibT_eX]

[DOI]

Discret. Math., 2002

Ideal clutters.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

Perfect Graphs, Partitionable Graphs and Cutsets.

[BibT_eX]

[DOI]

Comb., 2002

Split Closure and Intersection Cuts.

[BibT_eX]

[DOI]

Kent Andersen

Proceedings of the Integer Programming and Combinatorial Optimization, 2002

2001

Elementary closures for integer programs.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2001

Balanced 0-1 Matrices II. Recognition Algorithm.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2001

Balanced 0-1 Matrices I. Decomposition.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2001

Perfect, ideal and balanced matrices.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2001

On the Rank of Mixed 0, 1 Polyhedra.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2001

2000

On Padberg's conjecture about almost totally unimodular matrices.

[BibT_eX]

[DOI]

Luis Fernando Zuluaga

Oper. Res. Lett., 2000

Triangle-free graphs that are signable without even holes.

[BibT_eX]

[DOI]

J. Graph Theory, 2000

1999

Even and odd holes in cap-free graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1999

Decomposition of Balanced Matrices.

[BibT_eX]

[DOI]

M. R. Rao

J. Comb. Theory B, 1999

Balanced cycles and holes in bipartite graphs.

[BibT_eX]

[DOI]

Discret. Math., 1999

1998

Foreword.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

The Packing Property.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

A Class of Hard Small 0-1 Programs.

[BibT_eX]

[DOI]

Milind Dawande

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1997

Universally Signable Graphs.

[BibT_eX]

[DOI]

Comb., 1997

Finding an Even Hole in a Graph.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

Decomposition of Integer Programs and of Generating Sets.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1997

1996

Gomory cuts revisited.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1996

Perfect Matchings in Balanced Hypergraphs.

[BibT_eX]

[DOI]

Comb., 1996

1995

Balanced 0, +-1-matrixces, bicoloring and total dual integrality.

[BibT_eX]

[DOI]

Math. Program., 1995

Decomposition of Wheel-and-parachute-free Balanced Bipartite Graphs.

[BibT_eX]

[DOI]

M. R. Rao

Discret. Appl. Math., 1995

A Mickey-Mouse Decomposition Theorem.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

Combining and Strengthening Gomory Cuts.

[BibT_eX]

[DOI]

Sebastián Ceria

Milind Dawande

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1994

From Totally Unimodular to Balanced 0, ±1 Matrices: A Family of Integer Polytopes.

[BibT_eX]

[DOI]

Klaus Truemper

Math. Oper. Res., 1994

Ideal 0, 1 Matrices.

[BibT_eX]

[DOI]

Beth Novick

J. Comb. Theory B, 1994

Recognizing Balanced 0, +/- Matrices.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993

Polyhedral study of the capacitated vehicle routing problem.

[BibT_eX]

[DOI]

Farid Harche

Math. Program., 1993

A lift-and-project cutting plane algorithm for mixed 0-1 programs.

[BibT_eX]

[DOI]

Egon Balas

Sebastián Ceria

Math. Program., 1993

Complete Multi-partite Cutsets in Minimal Imperfect Graphs.

[BibT_eX]

[DOI]

Bruce A. Reed

J. Comb. Theory B, 1993

Solving Mixed 0-1 Programs by a Lift-and-Project Method.

[BibT_eX]

[DOI]

Egon Balas

Sebastián Ceria

Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

Polyhedral methods for the maximum clique problem.

[BibT_eX]

[DOI]

Proceedings of the Cliques, 1993

1992

A Class of Logic Problems Solvable by Linear Programming

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1990

A Projection Method for the Uncapacitated Facility Location Problem.

[BibT_eX]

[DOI]

Andrew R. Conn

Math. Program., 1990

A Decomposition Theorem for Balanced Matrices.

[BibT_eX]

Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

1989

On the 0, 1 facets of the set covering polytope.

[BibT_eX]

[DOI]

Antonio Sassano

Math. Program., 1989

1988

A matroid algorithm and its application to the efficient solution of two optimization problems on graphs.

[BibT_eX]

[DOI]

Carl Brezovec

Fred W. Glover

Math. Program., 1988

Probabilistic Analysis of a Relaxation for the k-Median Problem.

[BibT_eX]

[DOI]

Math. Oper. Res., 1988

General factors of graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1988

1987

An algorithmic framework for the matching problem in some hypergraphs.

[BibT_eX]

[DOI]

Networks, 1987

1986

Two algorithms for weighted matroid intersection.

[BibT_eX]

[DOI]

Carl Brezovec

Fred W. Glover

Math. Program., 1986

An extension of matching theory.

[BibT_eX]

[DOI]

David Hartvigsen

J. Comb. Theory B, 1986

1985

The Traveling Salesman Problem in Graphs with 3-Edge Cutsets

[BibT_eX]

[DOI]

Denis Naddef

J. ACM, April, 1985

The traveling salesman problem on a graph and some related integer polyhedra.

[BibT_eX]

[DOI]

Jean Fonlupt

Denis Naddef

Math. Program., 1985

Compositions for perfect graphs.

[BibT_eX]

[DOI]

William H. Cunningham

Discret. Math., 1985

1984

Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1984

1983

Halin graphs and the travelling salesman problem.

[BibT_eX]

[DOI]

Denis Naddef

Math. Program., 1983

Critical graphs, matching and tours or a hierarchy of relaxations for the traveling salesman problem.

[BibT_eX]

[DOI]

Comb., 1983

1982

Packing subgraphs in a graph.

[BibT_eX]

[DOI]

David Hartvigsen

Oper. Res. Lett., 1982

Some facets of the simple plant location polytope.

[BibT_eX]

[DOI]

Jean-Michel Thizy

Math. Program., 1982

1980

A Canonical Representation of Simple Plant Location Problems and Its Applications.

[BibT_eX]

[DOI]

George L. Nemhauser

Laurence A. Wolsey

SIAM J. Algebraic Discret. Methods, 1980

Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem.

[BibT_eX]

[DOI]

George L. Nemhauser

Laurence A. Wolsey

Oper. Res., 1980

A matching problem with side conditions.

[BibT_eX]

[DOI]

Discret. Math., 1980

1978

Tight bounds for christofides' traveling salesman heuristic.

[BibT_eX]

[DOI]