Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem (Q2572248)
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: Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem |
scientific article; zbMATH DE number 2229495
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem |
scientific article; zbMATH DE number 2229495 |
Statements
Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem (English)
0 references
16 November 2005
0 references
Integer programming
0 references
Packing
0 references
Branch-and-price
0 references
0 references
0 references
0.8178865313529968
0 references
0.7988245487213135
0 references
0.7885991334915161
0 references
0.783872663974762
0 references
0.7837004065513611
0 references
