The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming.
Julien AntonioFabrice ChauvetChengbin ChuJean-Marie ProthPublished in: Eur. J. Oper. Res. (1999)
Keyphrases
- dynamic programming
- integer programming
- hyper heuristics
- cutting stock problems
- knapsack problem
- column generation
- search algorithm
- markov decision processes
- stereo matching
- heuristic search
- dynamic programming algorithms
- linear programming
- greedy algorithm
- greedy heuristic
- small sized
- optimal control
- multiple objectives
- search strategies
- lagrangian relaxation
- infinite horizon
- single machine
- search heuristics
- heuristic rules
- heuristic methods
- real time
- state space
- multi objective
- pairwise
- optimal solution
- multiscale
- neural network