Tighter relaxations for the cutting stock problem (Q1806682): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:19, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tighter relaxations for the cutting stock problem |
scientific article |
Statements
Tighter relaxations for the cutting stock problem (English)
0 references
8 November 1999
0 references
linear programming relaxation
0 references
cutting stock problem
0 references
integer linear programming
0 references
integer round-up property
0 references
