Some NP-complete problems in linear programming.
R. ChandrasekaranSantosh N. KabadiKatta G. MurtyPublished in: Oper. Res. Lett. (1982)
Keyphrases
- np complete problems
- linear programming
- np complete
- graph coloring
- np hard
- phase transition
- hard problems
- sat problem
- optimal solution
- max sat
- dynamic programming
- integer programming
- combinatorial problems
- objective function
- constraint satisfaction
- decision problems
- search space
- lower bound
- metaheuristic
- satisfiability problem
- randomly generated
- special case
- evolutionary algorithm
- job shop scheduling