Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem.
Mhand HifiRym M'HallahToufik SaadiPublished in: Comput. Optim. Appl. (2009)
Keyphrases
- exact algorithms
- knapsack problem
- exact solution
- column generation
- benchmark instances
- vehicle routing problem with time windows
- three dimensional
- benders decomposition
- computational problems
- optimal solution
- np hard
- combinatorial optimization problems
- integer programming
- optimization problems
- dynamic programming
- approximation algorithms
- constraint programming
- lower bound
- linear programming
- branch and bound
- heuristic methods
- integer program
- greedy algorithm
- combinatorial optimization
- vehicle routing problem
- upper bound
- mixed integer programming
- genetic algorithm