Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm (Q4658529): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:13, 7 February 2024
scientific article; zbMATH DE number 2146789
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm |
scientific article; zbMATH DE number 2146789 |
Statements
Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm (English)
0 references
16 March 2005
0 references
linear programming
0 references
integer programming
0 references
cutting stock problem
0 references
cutting planes
0 references
column generation
0 references
