DeepAI AI Chat
Log In Sign Up

On modeling hard combinatorial optimization problems as linear programs: Refutations of the "unconditional impossibility" claims

by   Moustapha Diaby, et al.
University of Connecticut
University at Buffalo

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.


page 1

page 2

page 3

page 4


On modeling NP-Complete problems as polynomial-sized linear programs: Escaping/Side-stepping the "barriers"

In view of the extended formulations (EFs) developments (e.g. "Fiorini, ...

Second Order Swarm Intelligence

An artificial Ant Colony System (ACS) algorithm to solve general-purpose...

The n-vehicle exploration problem is NP-complete

The n-vehicle exploration problem (NVEP) is a combinatorial optimization...

Approximating multiobjective combinatorial optimization problems with the OWA criterion

The paper deals with a multiobjective combinatorial optimization problem...

A cost-scaling algorithm for computing the degree of determinants

In this paper, we address computation of the degree deg Det A of Dieudon...

Ising-based Consensus Clustering on Specialized Hardware

The emergence of specialized optimization hardware such as CMOS annealer...

A Strongly Polynomial Label-Correcting Algorithm for Linear Systems with Two Variables per Inequality

We present a strongly polynomial label-correcting algorithm for solving ...