A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems (Q5202025)
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 4193452
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems |
scientific article; zbMATH DE number 4193452 |
Statements
A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems (English)
0 references
1990
0 references
cutting stock
0 references
0.90765095
0 references
0 references
0.8760333
0 references
0 references
0.8721236
0 references
0.86867297
0 references
0 references
