Trainyard is NP-Hard.
Matteo AlmanzaStefano LeucciAlessandro PanconesiPublished in: Theor. Comput. Sci. (2018)
Keyphrases
- np hard
- optimal solution
- scheduling problem
- np complete
- special case
- integer programming
- remains np hard
- lower bound
- computational complexity
- np hardness
- minimum cost
- linear programming
- approximation algorithms
- constraint satisfaction problems
- decision problems
- branch and bound algorithm
- worst case
- knapsack problem
- upper bound
- set cover
- artificial neural networks
- multi agent
- similarity measure
- greedy heuristic
- computationally hard
- database