Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem (Q1662642): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.disopt.2018.02.003 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISOPT.2018.02.003 / rank | |||
Normal rank | |||
Revision as of 01:51, 11 December 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
0 references
0 references
0 references
0 references
0 references
0 references
