Car sequencing is NP-hard: a short proof.
Bertrand EstellonFrédéric GardiPublished in: J. Oper. Res. Soc. (2013)
Keyphrases
- np hard
- cost based abduction
- scheduling problem
- np complete
- optimal solution
- approximation algorithms
- theorem proving
- branch and bound algorithm
- computational complexity
- special case
- information retrieval
- computationally hard
- np hardness
- closely related
- constraint satisfaction problems
- linear programming
- lower bound
- integer programming
- set cover
- search algorithm
- linear logic
- complete axiomatization
- data sets
- remains np hard
- car navigation