A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts (Q2899132): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 08:58, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts |
scientific article |
Statements
A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts (English)
0 references
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
