Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem.
François ClautiauxRuslan SadykovFrançois VanderbeckQuentin ViaudPublished in: Discret. Optim. (2018)
Keyphrases
- knapsack problem
- dynamic programming
- randomly generated test instances
- combinatorial optimization problems
- continuous relaxation
- test problems
- greedy algorithm
- optimal solution
- exact algorithms
- np hard problems
- multistage
- three dimensional
- linear programming relaxation
- heuristic solution
- optimization problems
- linear programming
- multidimensional knapsack problem
- np hard
- greedy heuristic
- bicriteria
- linear program
- implicit enumeration
- single machine
- scheduling problem
- maximum profit
- random variables