A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775)
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 7290855
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems |
scientific article; zbMATH DE number 7290855 |
Statements
A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (English)
0 references
7 January 2021
0 references
bin packing
0 references
bin packing with conflicts
0 references
branch-and-price-and-cut
0 references
exact algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8298137784004211
0 references
0.8212078213691711
0 references
0.8174015879631042
0 references
0.8091322183609009
0 references
0.8089726567268372
0 references
