A branch-and-cut algorithm for the pallet loading problem (Q1781574)
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: A branch-and-cut algorithm for the pallet loading problem |
scientific article; zbMATH DE number 2183208
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for the pallet loading problem |
scientific article; zbMATH DE number 2183208 |
Statements
A branch-and-cut algorithm for the pallet loading problem (English)
0 references
27 June 2005
0 references
Pallet loading
0 references
Packing
0 references
Maximum independent set
0 references
0 references
0 references
0 references
0 references
0.9328975
0 references
0.9151163
0 references
0.91295356
0 references
0.9106753
0 references
0.9087812
0 references
0.9086481
0 references
0.90783083
0 references
0 references
