A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation (Q2673554)
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 MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation |
scientific article; zbMATH DE number 7539479
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation |
scientific article; zbMATH DE number 7539479 |
Statements
A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation (English)
0 references
10 June 2022
0 references
packing
0 references
conflicts
0 references
fragmentation
0 references
heuristics
0 references
MILP
0 references
0 references
0 references
0.895996630191803
0 references
0.8152269124984741
0 references
0.811626136302948
0 references
0.8094622492790222
0 references
0.7999064326286316
0 references
