Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem (Q819064)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5014250
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem |
scientific article; zbMATH DE number 5014250 |
Statements
Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem (English)
0 references
22 March 2006
0 references
partitioning
0 references
cardinality constraints
0 references
scheduling
0 references
parallel machines
0 references
bin packing
0 references
scatter search
0 references
column generation
0 references
0 references
0.8254082202911377
0 references
0.7928975820541382
0 references
0.7869793176651001
0 references
