Exponential Lower Bounds for Polytopes in Combinatorial Optimization
Work
Year: 2015
Type: article
Abstract: We solve a 20-year old problem posed by Yannakakis and prove that no polynomial-size linear program (LP) exists whose associated polytope projects to the traveling salesman polytope, even if the LP is... more
Source: Journal of the ACM
Institutions Université Libre de Bruxelles, Georgia Institute of Technology, Centrum Wiskunde & Informatica, University of Amsterdam
Cites: 80
Cited by: 129
Related to: 10
FWCI: 17.03
Citation percentile (by year/subfield): 95.19
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Grant IDS 255961, 600700,