A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint (Q610980): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10479-008-0452-9 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10479-008-0452-9 / rank | |||
Normal rank | |||
Latest revision as of 22:26, 9 December 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
0 references
0 references
0 references
0 references
