Heuristic and exact methods for the cutting sequencing problem.
Enrico FaggioliCarlo Alberto BentivoglioPublished in: Eur. J. Oper. Res. (1998)
Keyphrases
- exact methods
- exact algorithms
- np hard
- lower bound
- integer programming
- branch and bound algorithm
- heuristic methods
- optimal solution
- exact solution
- search methods
- tabu search
- branch and bound
- special case
- search algorithm
- constraint satisfaction
- upper bound
- column generation
- running times
- approximation algorithms
- approximate solutions
- genetic algorithm