The STO-Problem is NP-Hard.
Krzysztof R. AptPeter van Emde BoasAngelo WellingPublished in: J. Symb. Comput. (1994)
Keyphrases
- np hard
- scheduling problem
- approximation algorithms
- np complete
- optimal solution
- minimum cost
- special case
- closely related
- lower bound
- branch and bound algorithm
- remains np hard
- np hardness
- worst case
- linear programming
- approximate solutions
- constraint satisfaction problems
- integer programming
- greedy heuristic
- neural network
- computationally challenging
- computationally hard
- artificial intelligence
- trade off
- three dimensional
- computational complexity
- binary variables
- knapsack problem
- np hard problems
- decision problems