| dc.contributor.author | Karp, Richard M. Papadimitriou, Christos H. | en_US |
| dc.date.accessioned | 2023-03-29T14:15:49Z | |
| dc.date.available | 2023-03-29T14:15:49Z | |
| dc.date.issued | 1980-02 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/148981 | |
| dc.description.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. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TM-154 | |
| dc.title | On Linear Characterizations of Combinatorial Optimization Problems | en_US |
| dc.identifier.oclc | 6681530 | |
