| Publication | Date of Publication | Type |
|---|
Binary extended formulations and sequential convexification
Mathematics of Operations Research | 2024-11-07 | Paper |
Slack matrices, \(k\)-products, and 2-level polytopes
Discrete Applied Mathematics | 2024-06-20 | Paper |
Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective
4OR | 2023-10-26 | Paper |
Complexity of branch-and-bound and cutting planes in mixed-integer optimization
Mathematical Programming. Series A. Series B | 2023-03-01 | Paper |
Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
A mickey-mouse decomposition theorem
Integer Programming and Combinatorial Optimization | 2022-08-30 | Paper |
Extended formulations for stable set polytopes of graphs without two disjoint odd cycles
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
| 2021-12-21 | Paper |
Recognizing Cartesian products of matrices and polytopes
| 2021-12-08 | Paper |
The stable set problem in graphs with bounded genus and bounded odd cycle packing number
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Split cuts in the plane
SIAM Journal on Optimization | 2021-02-02 | Paper |
The structure of the infinite models in integer programming
Mathematics of Operations Research | 2020-04-30 | Paper |
Optimal cutting planes from the group relaxations
Mathematics of Operations Research | 2020-04-30 | Paper |
Complexity of branch-and-bound and cutting planes in mixed-integer optimization
| 2020-03-10 | Paper |
Balas formulation for the union of polytopes is optimal
Mathematical Programming. Series A. Series B | 2020-02-20 | Paper |
An extreme function which is nonnegative and discontinuous everywhere
Mathematical Programming. Series A. Series B | 2020-01-17 | Paper |
``Facet separation with one linear program
Mathematical Programming. Series A. Series B | 2019-10-22 | Paper |
Optimality certificates for convex minimization and Helly numbers
Operations Research Letters | 2019-02-22 | Paper |
Extreme functions with an arbitrary number of slopes
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
Subgraph polytopes and independence polytopes of count matroids
Operations Research Letters | 2018-09-28 | Paper |
The structure of the infinite models in integer programming
Lecture Notes in Computer Science | 2017-08-31 | Paper |
Maximal \(S\)-free convex sets and the Helly number
SIAM Journal on Discrete Mathematics | 2016-11-30 | Paper |
Cut dominants and forbidden minors
SIAM Journal on Discrete Mathematics | 2016-09-06 | Paper |
Extreme functions with an arbitrary number of slopes
Lecture Notes in Computer Science | 2016-08-10 | Paper |
The projected faces property and polyhedral relations
Mathematical Programming. Series A. Series B | 2016-04-04 | Paper |
Reverse split rank
Mathematical Programming. Series A. Series B | 2015-12-09 | Paper |
Reverse Chvátal-Gomory rank
SIAM Journal on Discrete Mathematics | 2015-11-27 | Paper |
Stable sets and graphs with no even holes
Mathematical Programming. Series A. Series B | 2015-10-14 | Paper |
A geometric approach to cut-generating functions
Mathematical Programming. Series A. Series B | 2015-06-19 | Paper |
Cut-generating functions and \(S\)-free sets
Mathematics of Operations Research | 2015-05-29 | Paper |
Integer Programming
Graduate Texts in Mathematics | 2014-10-02 | Paper |
Disjunctive programming and relaxations of polyhedra
Mathematical Programming. Series A. Series B | 2014-06-02 | Paper |
Reverse split rank
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
Cutting planes from two-term disjunctions
Operations Research Letters | 2014-05-15 | Paper |
On the convergence of the affine hull of the Chvàtal-Gomory closures
SIAM Journal on Discrete Mathematics | 2014-01-21 | Paper |
Unique lifting of integer variables in minimal inequalities
Mathematical Programming. Series A. Series B | 2013-11-11 | Paper |
Extended formulations in combinatorial optimization
Annals of Operations Research | 2013-08-08 | Paper |
Reverse Chvátal-Gomory rank
Lecture Notes in Computer Science | 2013-03-19 | Paper |
Cut-generating functions
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
A counterexample to a conjecture of Gomory and Johnson
Mathematical Programming. Series A. Series B | 2012-06-26 | Paper |
A geometric perspective on lifting
Operations Research | 2012-01-26 | Paper |
Maximal lattice-free convex sets in linear subspaces
Mathematics of Operations Research | 2011-04-27 | Paper |
Network Formulations of Mixed-Integer Programs
Mathematics of Operations Research | 2011-04-27 | Paper |
Projecting an extended formulation for mixed-integer covers on bipartite graphs
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 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 |
The mixing set with divisible capacities: a simple approach
Operations Research Letters | 2009-12-07 | Paper |
The Mixing Set with Divisible Capacities
Integer Programming and Combinatorial Optimization | 2008-06-10 | Paper |
Compact formulations as a union of polyhedra
Mathematical Programming. Series A. Series B | 2008-06-04 | Paper |
Minimally Infeasible Set-Partitioning Problems with Balanced Constraints
Mathematics of Operations Research | 2008-05-27 | Paper |
Packing Odd Circuits
SIAM Journal on Discrete Mathematics | 2008-05-22 | Paper |
The Mixing Set with Flows
SIAM Journal on Discrete Mathematics | 2008-05-22 | Paper |
The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
Mixed-Integer Vertex Covers on Bipartite Graphs
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
Balanced matrices
| 2007-06-19 | Paper |
Decomposing Berge graphs containing no proper wheel, long prism or their complements
Combinatorica | 2007-05-08 | Paper |
Balanced matrices
Discrete Mathematics | 2006-10-30 | Paper |
Odd Hole Recognition in Graphs of Bounded Clique Size
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Recognizing balanceable matrices
Mathematical Programming. Series A. Series B | 2006-01-13 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
scientific article; zbMATH DE number 2196276 (Why is no real title available?)
| 2005-08-22 | Paper |
Disjoint paths in arborescences
Discrete Mathematics | 2005-04-28 | 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 |
On the cut polyhedron.
Discrete Mathematics | 2004-03-14 | 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 |
Balanced \(0,\pm 1\) matrices. I: Decomposition
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
Balanced \(0,\pm 1\) matrices. II: Recognition algorithm
Journal of Combinatorial Theory. Series B | 2002-12-10 | 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 |
Even-hole-free graphs. I: Decomposition theorem
Journal of Graph Theory | 2002-06-02 | Paper |
Shortest paths in conservative graphs
Discrete Mathematics | 2001-05-21 | 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 |
A theorem of Truemper
Combinatorica | 2000-11-13 | Paper |
Balanced cycles and holes in bipartite graphs
Discrete Mathematics | 2000-07-05 | Paper |
A polyhedral approach to an integer multicommodity flow problem
Discrete Applied Mathematics | 2000-06-22 | Paper |
Even and odd holes in cap-free graphs
| 1999-05-26 | Paper |
scientific article; zbMATH DE number 1187142 (Why is no real title available?)
| 1999-03-02 | Paper |
scientific article; zbMATH DE number 1256705 (Why is no real title available?)
| 1999-03-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 |
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 |
scientific article; zbMATH DE number 927076 (Why is no real title available?)
| 1997-02-17 | Paper |
Perfect matchings in balanced hypergraphs
Combinatorica | 1997-01-23 | Paper |
A branch-and-cut algorithm for the equicut problem
Mathematical Programming. Series A. Series B | 1997-01-01 | 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 |
scientific article; zbMATH DE number 4116566 (Why is no real title available?)
| 1989-01-01 | Paper |
On the geometric structure of independence systems
Mathematical Programming. Series A. Series B | 1989-01-01 | Paper |
On the Facial Structure of Independence System Polyhedra
Mathematics of Operations Research | 1988-01-01 | Paper |
A characterization of matroidal systems of inequalities
Discrete Mathematics | 1988-01-01 | Paper |
A construction for binary matroids
Discrete Mathematics | 1987-01-01 | Paper |
Sequentially rejective pairwise testing procedures
Journal of Statistical Planning and Inference | 1987-01-01 | Paper |
Ki-covers. II.Ki-perfect graphs
Journal of Graph Theory | 1987-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 |
\(K_ i\)-covers. I: Complexity and polytopes
Discrete Mathematics | 1986-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 |
Steiner Cut Dominants
| N/A | Paper |
