Fetching the paper…
Reading the bibliography…
An extended formulation of a polyhedron $P$ is a linear description of a polyhedron $Q$ together with a linear map $\pi$ such that $\pi(Q)=P$.
Maximum matching and a polyhedron with 0, 1 vertices
Jack Edmonds · 1965
Earlier work this paper cites.
Matroids and the greedy algorithm
Jack Edmonds · 1971
Earlier work this paper cites.
On certain polytopes associated with graphs
Vašek Chvátal · 1975
Earlier work this paper cites.
On the ratio of optimal integral and fractional covers
László Lovász · 1975
Earlier work this paper cites.
Using separation algorithms to generate mixed integer model reformulations
Richard Kipp Martin · 1991
Earlier work this paper cites.
Expressing combinatorial optimization problems by linear programs
Mihalis Yannakakis · 1991
Earlier work this paper cites.
The probabilistic communication complexity of set intersection
Bala Kalyanasundaram and Georg Schnitger · 1992
Earlier work this paper cites.
On the distributional complexity of disjointness
Alexander A. Razborov · 1992
Earlier work this paper cites.
Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
Joel E. Cohen and Uriel G. Rothblum · 1993
Earlier work this paper cites.
Geometric algorithms and combinatorial optimization
Martin Grötschel, László Lovász, and Alexander Schrijver · 1993
Cited alongside, same era.
Lectures on Polytopes
Günter M. Ziegler · 1995
Cited alongside, same era.
Communication complexity
Eyal Kushilevitz and Noam Nisan · 1997
Cited alongside, same era.
The extremal function for complete minors
Andrew Thomason · 2001
Cited alongside, same era.
Improved Quantum Communication Complexity Bounds for Disjointness and Equality
Peter Høyer and Ronald de Wolf · 2002
Cited alongside, same era.
A linear-size zero?one programming model for the minimum spanning tree problem in planar graphs
Justin C. Williams · 2002
Cited alongside, same era.
The stable set polytope of claw-free graphs with large stability number
Anna Galluccio, Claudio Gentile, and Paolo Ventura · 2010
Later among the works it cites.
Symmetry matters for the sizes of extended formulations
Volker Kaibel, Kanstantsin Pashkovich, and Dirk Oliver Theis · 2010
Later among the works it cites.
Extended formulations in combinatorial optimization
Volker Kaibel · 2011
Closest in time.
Some 0/1 polytopes need exponential size extended formulations
Thomas Rothvoß · 2011
Closest in time.
Using extended formulations in practice
Laurence A. Wolsey · 2011
Closest in time.
Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs
Yuri Faenza, Gianpaolo Oriolo, and Gautier Stauffer · 2012
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Alexander Schrijver · 2003
Cited alongside, same era.
The story of set disjointness
Arkadev Chattopadhyay, Toniann Pitassi · 2010
Cited alongside, same era.
Extended formulations in combinatorial optimization
Michele Conforti, Gérard Cornuéjols, and Giacomo Zambelli · 2010
Cited alongside, same era.
Combinatorial bounds on nonnegative rank and extended formulations,
Samuel Fiorini, Volker Kaibel, Kanstantsin Pashkovich, and Dirk Oliver Theis
Cited in the paper.
Closest in time.
Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds
Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, and Ronald de Wolf · 2012
Closest in time.
Quantum Strategic Game Theory
Shengyu Zhang · 2012
Closest in time.