| Publication | Date of Publication | Type |
|---|
Erratum to: ``Arc connectivity and submodular flows in digraphs
Combinatorica | 2025-01-14 | Paper |
On finding exact solutions of linear programs in the oracle model
| 2024-07-19 | Paper |
Arc connectivity and submodular flows in digraphs
| 2023-10-30 | Paper |
Geometric rescaling algorithms for submodular function minimization
Mathematics of Operations Research | 2021-09-14 | Paper |
Rescaling algorithms for linear conic feasibility
Mathematics of Operations Research | 2020-09-01 | Paper |
Optimal cutting planes from the group relaxations
Mathematics of Operations Research | 2020-04-30 | Paper |
A polynomial projection-type algorithm for linear programming
Operations Research Letters | 2018-08-27 | Paper |
On matrices with the Edmonds-Johnson property arising from bidirected graphs
Journal of Combinatorial Theory. Series B | 2018-04-18 | Paper |
Geometric rescaling algorithms for submodular function minimization
| 2018-03-15 | Paper |
Rescaled coordinate descent methods for linear programming
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
Integer Programming
Graduate Texts in Mathematics | 2014-10-02 | Paper |
Cutting planes from two-term disjunctions
Operations Research Letters | 2014-05-15 | 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 |
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 |
Convex sets and minimal sublinear functions
| 2011-05-06 | Paper |
Maximal lattice-free convex sets in linear subspaces
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 |
Half-integral vertex covers on bipartite bidirected graphs: total dual integrality and cut-rank
SIAM Journal on Discrete Mathematics | 2010-08-27 | 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 |
On degenerate multi-row Gomory cuts
Operations Research Letters | 2009-02-23 | Paper |
Minimally Infeasible Set-Partitioning Problems with Balanced Constraints
Mathematics of Operations Research | 2008-05-27 | Paper |
Colorings of \(k\)-balanced matrices and integer decomposition property of related polyhedra
Operations Research Letters | 2008-01-21 | Paper |
Mixed-Integer Vertex Covers on Bipartite Graphs
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
Decomposing Berge graphs containing no proper wheel, long prism or their complements
Combinatorica | 2007-05-08 | 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 |
A polynomial recognition algorithm for balanced matrices
Journal of Combinatorial Theory. Series B | 2005-09-28 | 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 |
