A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint (Q610980): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10479-008-0452-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2030744036 / rank | |||
Normal rank | |||
Revision as of 20:58, 19 March 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
