Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem (Q1662642)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem |
scientific article; zbMATH DE number 6920582
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem |
scientific article; zbMATH DE number 6920582 |
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
0 references
0 references
0 references
0 references
0 references
0 references
0.8342275023460388
0 references
0.8169930577278137
0 references
0.8057617545127869
0 references
0.7931658625602722
0 references
