On modeling hard combinatorial optimization problems as linear programs: Refutations of the "unconditional impossibility" claims
Computational Complexity
2019-02-12 v1 Data Structures and Algorithms
Optimization and Control
Abstract
There has been a series of developments in the recent literature (by essentially a same "circle" of authors) with the absolute/unconditioned (implicit or explicit) claim that there exists no abstraction of an NP-Complete combinatorial optimization problem in which the defining combinatorial configurations (such as "tours" in the case of the traveling salesman problem (TSP) for example) can be modeled by a polynomial-sized system of linear constraints. The purpose of this paper is to provide general as well as specific refutations for these recent claims.
Cite
@article{arxiv.1902.03549,
title = {On modeling hard combinatorial optimization problems as linear programs: Refutations of the "unconditional impossibility" claims},
author = {Moustapha Diaby and Mark H. Karwan and Lei Sun},
journal= {arXiv preprint arXiv:1902.03549},
year = {2019}
}
Comments
17 pages; 3 figures