Solving binary cutting stock problems by column generation and branch- and-bound (Q1326509): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: MINTO / rank | |||
Normal rank |
Revision as of 14:56, 28 February 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