Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation (Q5086008)
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: Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation |
scientific article; zbMATH DE number 7551226
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation |
scientific article; zbMATH DE number 7551226 |
Statements
Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation (English)
0 references
30 June 2022
0 references
bin packing
0 references
integer programming
0 references
branch-and-price
0 references
decision diagrams
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7992214560508728
0 references
0.7526078224182129
0 references
0.7459908723831177
0 references
0.7435291409492493
0 references
0.7427435517311096
0 references
