On Linear Characterizations of Combinatorial Optimization Problems
Name
MIT-LCS-TM-154.pdf
Size
4.18 MB
Format
Adobe PDF
Checksum (MD5)
c8fc17681dbc235c9173b8d8bf8a8c60
Author(s)
Karp, Richard M. Papadimitriou, Christos H.
Date Issued
February 1980
Series/Report no.
MIT-LCS-TM-154
Abstract
We show that there can be no computationally tractable description by linear inequalities of the polyhedron associated with any NP-complete combinatorial optimization problem unless NP=co-NP -- a very unlikely event. We also use the recent result by Khacian to present even stronger evidence that NP-complete combinatorial optimization problems cannot have efficient generators of violated inequalities.
Persistent DSpace Link
