Why Linear Programming cannot solve large instances of NP-complete problems in polynomial time
Radoslaw HofmanPublished in: CoRR (2006)
Keyphrases
- np complete problems
- linear programming
- np complete
- graph coloring
- phase transition
- suboptimal solutions
- nonlinear programming
- hard problems
- random instances
- np hard
- linear program
- sat problem
- constraint satisfaction problems
- computational complexity
- randomly generated
- special case
- decision problems
- algorithm for linear programming
- valid inequalities
- satisfiability problem
- job shop scheduling
- objective function
- constraint propagation
- combinatorial problems
- max sat
- feasible solution
- dynamic programming