A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting.
Xiang SongC. B. ChuRhyd LewisY. Y. NieJonathan M. ThompsonPublished in: Eur. J. Oper. Res. (2010)
Keyphrases
- worst case analysis
- guillotine cutting
- dynamic programming
- average case
- worst case
- linear programming relaxation
- greedy algorithm
- greedy heuristic
- np hardness
- linear programming
- knapsack problem
- multistage
- state space
- optimal control
- reinforcement learning
- uniform distribution
- lagrangian relaxation
- linear program
- optimal policy
- special case