Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program

Saved in:
Bibliographic Details
Published in:SIAM journal on optimization 2019-01, Vol.29 (3), p.1745-1771
Main Authors: Průša, Daniel, Werner, Tomáš
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:
ISSN:1052-6234
1095-7189
DOI:10.1137/17M1142922