Unstacking Slabs Safely in Megalit is NP-Hard.
Kirby GordonJacob LezbergAaron WilliamsPublished in: CCCG (2022)
Keyphrases
- np hard
- special case
- approximation algorithms
- optimal solution
- scheduling problem
- computational complexity
- remains np hard
- lower bound
- linear programming
- production line
- greedy heuristic
- constraint satisfaction problems
- steel industry
- np hardness
- closely related
- np complete
- minimum cost
- decision problems
- np hard problems
- evolutionary algorithm
- integer programming
- computationally hard
- computationally challenging
- knapsack problem
- branch and bound algorithm
- set cover
- worst case