Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm (Q4658529)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2146789
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.91889488697052
0 references
0.9009099006652832
0 references
0.8956698179244995
0 references
