Solving binary cutting stock problems by column generation and branch- and-bound (Q1326509): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:23, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving binary cutting stock problems by column generation and branch- and-bound |
scientific article |
Statements
Solving binary cutting stock problems by column generation and branch- and-bound (English)
0 references
18 May 1994
0 references
binary cutting stock problem
0 references
column generation
0 references
branch-and-bound
0 references
