A branch-and-price algorithm for the bin packing problem with conflicts (Q2899132)
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-price algorithm for the bin packing problem with conflicts |
scientific article; zbMATH DE number 6060529
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-price algorithm for the bin packing problem with conflicts |
scientific article; zbMATH DE number 6060529 |
Statements
28 July 2012
0 references
bin packing problem with conflicts
0 references
branch and price
0 references
Lagrangean relaxation
0 references
maximal clique inequalities
0 references
A branch-and-price algorithm for the bin packing problem with conflicts (English)
0 references
