A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems |
scientific article |
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 references
