Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem (Q1662642): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:37, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem |
scientific article |
Statements
Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem (English)
0 references
20 August 2018
0 references
cutting and packing
0 references
dynamic programming
0 references
Lagrangian filtering
0 references
reduced-cost fixing
0 references
