A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint (Q610980): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Knapsack / rank | |||
Normal rank | |||
Revision as of 11:20, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint |
scientific article |
Statements
A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint (English)
0 references
13 December 2010
0 references
bin packing
0 references
column generation
0 references
branch-and-price
0 references
