Fetching the paper…
Reading the bibliography…
A popular method in combinatorial optimization is to express polytopes P, which may potentially have exponentially many facets, as solutions of linear programs that use few extra variables to reduce the number of constraints down to a polynomial.
Maximum matching and a polyhedron with 0 , 1 0,1 -vertices
J. Edmonds · 1965
Earlier work this paper cites.
Matroids and the greedy algorithm
J. Edmonds · 1971
Earlier work this paper cites.
Odd minimum cut-sets and b-matchings
M. Padberg and M. Rao · 1982
Earlier work this paper cites.
Disjunctive programming and a hierarchy of relaxations for discrete optimization problems
E. Balas · 1985
Earlier work this paper cites.
On the distributional complexity of disjointness
A. Razborov · 1990
Earlier work this paper cites.
Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus
A. M. H. Gerards · 1991
Earlier work this paper cites.
Using separation algorithms to generate mixed integer model reformulations
R. Kipp Martin · 1991
Earlier work this paper cites.
Expressing combinatorial optimization problems by linear programs
M. Yannakakis · 1991
Earlier work this paper cites.
On cuts and matchings in planar graphs
F. Barahona · 1993
Earlier work this paper cites.
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
M. X. Goemans and D. P. Williamson · 1995
Earlier work this paper cites.
Combinatorial optimization. Polyhedra and efficiency. Vol. A,B,C
A. Schrijver · 2003
Cited alongside, same era.
A compact linear program for testing optimality of perfect matchings
P. Ventura and F. Eisenbrand · 2003
Cited alongside, same era.
Symmetry matters for the sizes of extended formulations
V. Kaibel, K. Pashkovich, and D. O. Theis · 2010
Cited alongside, same era.
Approximation limits of linear programs (beyond hierarchies)
G. Braun, S. Fiorini, S. Pokutta, and D. Steurer · 2012
Cited alongside, same era.
Extended formulations, nonnegative factorizations, and randomized communication protocols
Y. Faenza, S. Fiorini, R. Grappe, and H. R. Tiwary · 2012
Cited alongside, same era.
Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds
S. Fiorini, S. Massar, S. Pokutta, H. Tiwary, and R. de Wolf · 2012
An information complexity approach to extended formulations
M. Braverman and A. Moitra · 2013
Closest in time.
Common information and unique disjointness
G. Braun and S. Pokutta · 2013
Closest in time.
Approximate constraint satisfaction requires large LP relaxations
S. O. Chan, J. R. Lee, P. Raghavendra, and D. Steurer · 2013
Closest in time.
Personal communication, 2013
S. Fiorini · 2013
Closest in time.
Combinatorial bounds on nonnegative rank and extended formulations
S. Fiorini, V. Kaibel, K. Pashkovich, and D. O. Theis · 2013
Closest in time.
A note on the extension complexity of the knapsack polytope
S. Pokutta and M. Van Vyve · 2013
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Extended formulations for polygons
S. Fiorini, T. Rothvoß, and H. R. Tiwary · 2012
Cited alongside, same era.
Some 0/1 polytopes need exponential size extended formulations
T. Rothvoss · 2012
Cited alongside, same era.
On the extension complexity of combinatorial polytopes
D. Avis and H. R. Tiwary · 2013
Cited alongside, same era.
On the existence of 0/1 polytopes with high semidefinite extension complexity
J Briët, D. Dadush, and S. Pokutta · 2013
Cited alongside, same era.
G. Braun and S. Pokutta · 2014
Closest in time.
Smallest compact formulation for the permutahedron
M. X. Goemans · 2015
Closest in time.
Lower bounds on the size of semidefinite programming relaxations
J. R. Lee, P. Raghavendra, and D. Steurer · 2015
Closest in time.