| Publication | Date of Publication | Type |
|---|
Arc connectivity and submodular flows in digraphs
Combinatorica | 2025-01-14 | Paper |
Erratum to: ``Arc connectivity and submodular flows in digraphs
Combinatorica | 2025-01-14 | Paper |
Total dual dyadicness and dyadic generating sets
Mathematical Programming. Series A. Series B | 2024-08-20 | Paper |
| Approximately Packing Dijoins via Nowhere-Zero Flows | 2023-11-07 | Paper |
| Arc connectivity and submodular flows in digraphs | 2023-10-30 | Paper |
On Packing Dijoins in Digraphs and Weighted Digraphs
SIAM Journal on Discrete Mathematics | 2023-10-26 | Paper |
| Dyadic linear programming and extensions | 2023-09-08 | Paper |
Testing idealness in the filter oracle model
Operations Research Letters | 2022-12-12 | Paper |
Idealness of \(k\)-wise intersecting families
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
On dyadic fractional packings of \(T\)-joins
SIAM Journal on Discrete Mathematics | 2022-10-06 | Paper |
Combining and strengthening Gomory cuts
Integer Programming and Combinatorial Optimization | 2022-08-30 | Paper |
A mickey-mouse decomposition theorem
Integer Programming and Combinatorial Optimization | 2022-08-30 | Paper |
Total dual dyadicness and dyadic generating sets
(available as arXiv preprint) | 2022-08-16 | Paper |
Clean clutters and dyadic fractional packings
SIAM Journal on Discrete Mathematics | 2022-04-20 | Paper |
Correction to: ``Idealness of \(k\)-wise intersecting families
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
Idealness of \(k\)-wise intersecting families
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
Clean tangled clutters, simplices, and projective geometries
Journal of Combinatorial Theory. Series B | 2022-03-03 | Paper |
Testing idealness in the filter oracle model
(available as arXiv preprint) | 2022-02-15 | Paper |
| Decomposition of integer programs and of generating sets | 2021-12-20 | Paper |
A new infinite class of ideal minimally non-packing clutters
Discrete Mathematics | 2021-06-14 | Paper |
Resistant sets in the unit hypercube
Mathematics of Operations Research | 2021-06-03 | Paper |
Intersecting restrictions in clutters
Combinatorica | 2021-03-20 | Paper |
The max-flow min-cut property and \(\pm 1\)-resistant sets
Discrete Applied Mathematics | 2020-12-29 | Paper |
Cuboids, a class of clutters
Journal of Combinatorial Theory. Series B | 2020-04-07 | Paper |
Ideal clutters that do not pack
Mathematics of Operations Research | 2020-03-12 | Paper |
Idealness and 2-resistant sets
Operations Research Letters | 2020-02-10 | Paper |
| Identically self-blocking clutters | 2020-02-06 | Paper |
On the rational polytopes with Chvátal rank 1
Mathematical Programming. Series A. Series B | 2020-01-17 | Paper |
When the Gomory-chvátal closure coincides with the integer hull
Operations Research Letters | 2019-06-11 | Paper |
| scientific article; zbMATH DE number 7051293 (Why is no real title available?) | 2019-05-06 | Paper |
From estimation to optimization via shrinkage
Operations Research Letters | 2019-02-22 | Paper |
Optimality certificates for convex minimization and Helly numbers
Operations Research Letters | 2019-02-22 | Paper |
On some polytopes contained in the 0,1 hypercube that have a small Chvátal rank
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
Disjunctive cuts for cross-sections of the second-order cone
Operations Research Letters | 2018-09-28 | Paper |
| Optimization methods in finance. | 2018-08-07 | Paper |
| Incorporating Black-Litterman Views in Portfolio Construction when Stock Returns are a Mixture of Normals | 2017-06-10 | Paper |
Cut-generating functions for integer variables
Mathematics of Operations Research | 2016-11-16 | Paper |
Deciding emptiness of the Gomory-Chvátal closure is NP-complete, even for a rational polyhedron containing no integer point
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
On some polytopes contained in the 0,1 hypercube that have a small Chvátal rank
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
Sufficiency of cut-generating functions
Mathematical Programming. Series A. Series B | 2015-08-31 | Paper |
Cut-generating functions and \(S\)-free sets
Mathematics of Operations Research | 2015-05-29 | Paper |
On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs
Mathematical Programming. Series A. Series B | 2015-04-16 | Paper |
| Branching on split disjunctions | 2014-11-10 | Paper |
On the safety of Gomory cut generators
Mathematical Programming Computation | 2014-10-06 | Paper |
Integer Programming
Graduate Texts in Mathematics | 2014-10-02 | Paper |
Cutting planes from two-term disjunctions
Operations Research Letters | 2014-05-15 | Paper |
A 3-slope theorem for the infinite relaxation in the plane
Mathematical Programming. Series A. Series B | 2014-02-03 | Paper |
Practical strategies for generating rank-1 split cuts in mixed-integer linear programming
Mathematical Programming Computation | 2013-11-28 | Paper |
Unique lifting of integer variables in minimal inequalities
Mathematical Programming. Series A. Series B | 2013-11-11 | Paper |
| Mixed integer nonlinear programs featuring ``on/off constraints: convex analysis and applications | 2013-11-08 | Paper |
Extended formulations in combinatorial optimization
Annals of Operations Research | 2013-08-08 | Paper |
The Chvátal closure of generalized stable sets in bidirected graphs
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
Lifting Gomory cuts with bounded variables
Operations Research Letters | 2013-05-14 | Paper |
The ongoing story of Gomory cuts
Documenta Mathematica | 2013-04-17 | Paper |
Cut-generating functions
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
Mixed-integer nonlinear programs featuring ``on/off constraints
Computational Optimization and Applications | 2012-09-27 | Paper |
How tight is the corner relaxation? Insights gained from the stable set problem
Discrete Optimization | 2012-09-11 | Paper |
Experiments with two-row cuts from degenerate tableaux
INFORMS Journal on Computing | 2012-07-28 | Paper |
A counterexample to a conjecture of Gomory and Johnson
Mathematical Programming. Series A. Series B | 2012-06-26 | Paper |
Early estimates of the size of branch-and-bound trees
INFORMS Journal on Computing | 2012-06-18 | Paper |
\(k\)-cuts: a variation of Gomory mixed integer cuts from the LP tableau
INFORMS Journal on Computing | 2012-05-30 | Paper |
Unique minimal liftings for simplicial polytopes
Mathematics of Operations Research | 2012-05-24 | Paper |
Intersection cuts with infinite Split rank
Mathematics of Operations Research | 2012-05-24 | Paper |
Reduce-and-Split cuts: improving the performance of mixed-integer Gomory cuts
Management Science | 2012-02-21 | Paper |
A geometric perspective on lifting
Operations Research | 2012-01-26 | Paper |
Improved strategies for branching on general disjunctions
Mathematical Programming. Series A. Series B | 2011-12-14 | Paper |
A probabilistic analysis of the strength of the split and triangle closures
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
Branching on general disjunctions
Mathematical Programming. Series A. Series B | 2011-06-17 | Paper |
Revival of the Gomory cuts in the 1990's
Annals of Operations Research | 2011-05-20 | Paper |
| Convex sets and minimal sublinear functions | 2011-05-06 | Paper |
Convex sets and minimal sublinear functions
(available as arXiv preprint) | 2011-05-06 | Paper |
Minimal valid inequalities for integer constraints
Mathematics of Operations Research | 2011-04-27 | Paper |
Maximal lattice-free convex sets in linear subspaces
Mathematics of Operations Research | 2011-04-27 | Paper |
Minimal inequalities for an infinite relaxation of integer programs
SIAM Journal on Discrete Mathematics | 2011-03-15 | Paper |
On the relative strength of split, triangle and quadrilateral cuts
Mathematical Programming. Series A. Series B | 2011-02-14 | Paper |
| The strong perfect graph theorem | 2010-09-21 | Paper |
On lifting integer variables in minimal inequalities
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
Equivalence between intersection cuts and the corner polyhedron
Operations Research Letters | 2010-06-08 | Paper |
Polyhedral approaches to mixed integer linear programming
50 Years of Integer Programming 1958-2008 | 2010-06-03 | Paper |
Extended formulations in combinatorial optimization
4OR | 2010-05-21 | Paper |
Stable sets, corner polyhedra and the Chvàtal closure
Operations Research Letters | 2009-12-07 | Paper |
On the facets of mixed integer programs with two integer variables and two constraints
Mathematical Programming. Series A. Series B | 2009-07-24 | Paper |
Lehman matrices
Journal of Combinatorial Theory. Series B | 2009-06-23 | Paper |
A feasibility pump for mixed integer nonlinear programs
Mathematical Programming. Series A. Series B | 2009-04-24 | Paper |
An algorithmic framework for convex mixed integer nonlinear programs
Discrete Optimization | 2008-10-29 | Paper |
A note on the MIR closure
Operations Research Letters | 2008-05-29 | Paper |
On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Projected Chvátal-Gomory cuts for mixed integer linear programs
Mathematical Programming. Series A. Series B | 2008-03-12 | Paper |
Valid inequalities for mixed integer linear programs
Mathematical Programming. Series A. Series B | 2007-09-10 | Paper |
| Balanced matrices | 2007-06-19 | Paper |
Decomposing Berge graphs containing no proper wheel, long prism or their complements
Combinatorica | 2007-05-08 | Paper |
| Optimization Methods in Finance | 2007-04-05 | Paper |
Balanced matrices
Discrete Mathematics | 2006-10-30 | Paper |
Recognizing Berge graphs
Combinatorica | 2006-06-27 | Paper |
A convex-analysis perspective on disjunctive cuts
Mathematical Programming. Series A. Series B | 2006-06-14 | Paper |
Odd Hole Recognition in Graphs of Bounded Clique Size
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
| scientific article; zbMATH DE number 2196276 (Why is no real title available?) | 2005-08-22 | Paper |
Split closure and intersection cuts
Mathematical Programming. Series A. Series B | 2005-04-29 | Paper |
| scientific article; zbMATH DE number 2159270 (Why is no real title available?) | 2005-04-19 | Paper |
| scientific article; zbMATH DE number 2086918 (Why is no real title available?) | 2004-08-11 | Paper |
Decomposition of odd-hole-free graphs by double star cutsets and 2-joins
Discrete Applied Mathematics | 2004-08-06 | Paper |
Square-free perfect graphs.
Journal of Combinatorial Theory. Series B | 2004-03-14 | Paper |
The packing property.
Mathematical Programming. Series A. Series B | 2004-02-18 | Paper |
A class of perfect graphs containing \(P_{6}\)
Journal of Combinatorial Theory. Series B | 2003-08-25 | Paper |
Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs
Journal of Combinatorial Theory. Series B | 2003-08-25 | Paper |
scientific article; zbMATH DE number 1789914 (Why is no real title available?)
(available as arXiv preprint) | 2003-02-06 | Paper |
Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour
SIAM Journal on Discrete Mathematics | 2003-01-05 | Paper |
Balanced \(0,\pm 1\) matrices. II: Recognition algorithm
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
Balanced \(0,\pm 1\) matrices. I: Decomposition
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
A connection between cutting plane theory and the geometry of numbers
Mathematical Programming. Series A. Series B | 2002-12-01 | Paper |
Perfect graphs, partitionable graphs and cutsets
Combinatorica | 2002-10-20 | Paper |
Even-hole-free graphs part II: Recognition algorithm
Journal of Graph Theory | 2002-09-29 | Paper |
On dijoins
Discrete Mathematics | 2002-09-25 | Paper |
Ideal clutters
Discrete Applied Mathematics | 2002-09-17 | Paper |
| scientific article; zbMATH DE number 1757948 (Why is no real title available?) | 2002-06-20 | Paper |
On the rank of mixed 0,1 polyhedra.
Mathematical Programming. Series A. Series B | 2002-06-18 | Paper |
Even-hole-free graphs. I: Decomposition theorem
Journal of Graph Theory | 2002-06-02 | Paper |
On Padberg's conjecture about almost totally unimodular matrices
Operations Research Letters | 2001-11-07 | Paper |
Elementary closures for integer programs.
Operations Research Letters | 2001-07-12 | Paper |
Combinatorial optimization. Packing and covering
CBMS-NSF Regional Conference Series in Applied Mathematics | 2001-05-30 | Paper |
| scientific article; zbMATH DE number 1496606 (Why is no real title available?) | 2001-01-23 | Paper |
Perfect, ideal and balanced matrices
European Journal of Operational Research | 2001-01-01 | Paper |
Balanced cycles and holes in bipartite graphs
Discrete Mathematics | 2000-07-05 | Paper |
| Even and odd holes in cap-free graphs | 1999-05-26 | Paper |
| scientific article; zbMATH DE number 1187159 (Why is no real title available?) | 1999-04-19 | Paper |
| scientific article; zbMATH DE number 1187138 (Why is no real title available?) | 1999-04-08 | Paper |
| scientific article; zbMATH DE number 1256705 (Why is no real title available?) | 1999-03-01 | Paper |
A Class of Hard Small 0-1 Programs
INFORMS Journal on Computing | 1999-01-01 | Paper |
| scientific article; zbMATH DE number 1175946 (Why is no real title available?) | 1998-07-19 | Paper |
A class of logic problems solvable by linear programming
Journal of the ACM | 1998-01-28 | Paper |
Universally signable graphs
Combinatorica | 1998-01-05 | Paper |
Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
Management Science | 1997-11-12 | Paper |
Gomory cuts revisited
Operations Research Letters | 1997-07-06 | Paper |
| scientific article; zbMATH DE number 1003240 (Why is no real title available?) | 1997-06-02 | Paper |
Perfect \(0,\pm 1\) matrices
Linear Algebra and its Applications | 1997-05-14 | Paper |
Perfect matchings in balanced hypergraphs
Combinatorica | 1997-01-23 | Paper |
| scientific article; zbMATH DE number 956840 (Why is no real title available?) | 1996-12-11 | Paper |
Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality
Mathematical Programming. Series A. Series B | 1996-09-18 | Paper |
From Totally Unimodular to Balanced 0, ±1 Matrices: A Family of Integer Polytopes
Mathematics of Operations Research | 1994-10-31 | Paper |
Ideal 0, 1 matrices
Journal of Combinatorial Theory. Series B | 1994-06-06 | Paper |
Complete multi-partite cutsets in minimal imperfect graphs
Journal of Combinatorial Theory. Series B | 1994-05-05 | Paper |
| scientific article; zbMATH DE number 437548 (Why is no real title available?) | 1993-12-15 | Paper |
Polyhedral study of the capacitated vehicle routing problem
Mathematical Programming. Series A. Series B | 1993-11-01 | Paper |
A lift-and-project cutting plane algorithm for mixed 0-1 programs
Mathematical Programming. Series A. Series B | 1993-08-17 | Paper |
| scientific article; zbMATH DE number 4202014 (Why is no real title available?) | 1990-01-01 | Paper |
A projection method for the uncapacitated facility location problem
Mathematical Programming. Series A. Series B | 1990-01-01 | Paper |
On the 0,1 facets of the set covering polytope
Mathematical Programming. Series A. Series B | 1989-01-01 | Paper |
General factors of graphs
Journal of Combinatorial Theory. Series B | 1988-01-01 | Paper |
A matroid algorithm and its application to the efficient solution of two optimization problems on graphs
Mathematical Programming. Series A. Series B | 1988-01-01 | Paper |
Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem. A correction
Discrete Applied Mathematics | 1987-01-01 | Paper |
An algorithmic framework for the matching problem in some hypergraphs
Networks | 1987-01-01 | Paper |
TRAVEL - An interactive travelling salesman problem package for the IBM- personal computer
Operations Research Letters | 1987-01-01 | Paper |
Two algorithms for weighted matroid intersection
Mathematical Programming | 1986-01-01 | Paper |
An extension of matching theory
Journal of Combinatorial Theory. Series B | 1986-01-01 | Paper |
The traveling salesman problem on a graph and some related integer polyhedra
Mathematical Programming | 1985-01-01 | Paper |
The traveling salesman problem in graphs with 3-edge cutsets
Journal of the ACM | 1985-01-01 | Paper |
Compositions for perfect graphs
Discrete Mathematics | 1985-01-01 | Paper |
Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
Discrete Applied Mathematics | 1984-01-01 | Paper |
Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem
Combinatorica | 1983-01-01 | Paper |
Halin graphs and the travelling salesman problem
Mathematical Programming | 1983-01-01 | Paper |
A Primal Approach to the Simple Plant Location Problem
SIAM Journal on Algebraic Discrete Methods | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3924538 (Why is no real title available?) | 1982-01-01 | Paper |
Packing subgraphs in a graph
Operations Research Letters | 1982-01-01 | Paper |
Some facets of the simple plant location polytope
Mathematical Programming | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3751015 (Why is no real title available?) | 1981-01-01 | Paper |
A Canonical Representation of Simple Plant Location Problems and Its Applications
SIAM Journal on Algebraic Discrete Methods | 1980-01-01 | Paper |
A matching problem with side conditions
Discrete Mathematics | 1980-01-01 | Paper |
Perfect triangle-free 2-matchings
Mathematical Programming Studies | 1980-01-01 | Paper |
Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem
Operations Research | 1980-01-01 | Paper |
Note—On “Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms”
Management Science | 1979-01-01 | Paper |
Tight bounds for christofides' traveling salesman heuristic
Mathematical Programming | 1978-01-01 | Paper |
Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
Management Science | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3559283 (Why is no real title available?) | 1977-01-01 | Paper |
