Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm (Q4658529): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1057/palgrave.jors.2601242 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2073944685 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:32, 20 March 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
