Combinatorial complexity of a certain 1-dimensional cutting stock problem (Q2900934)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Combinatorial complexity of a certain 1-dimensional cutting stock problem |
scientific article; zbMATH DE number 6059952
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combinatorial complexity of a certain 1-dimensional cutting stock problem |
scientific article; zbMATH DE number 6059952 |
Statements
26 July 2012
0 references
cutting stock problem
0 references
method of branches and boundaries
0 references
integer programming
0 references
combinatorial complexity
0 references
0.88034546
0 references
0.87833637
0 references
0.87753516
0 references
0 references
0.8726968
0 references
Combinatorial complexity of a certain 1-dimensional cutting stock problem (English)
0 references
