Experiments with parallel branch-and-bound algorithms for the set covering problem (Q1316095)
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 519589
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Experiments with parallel branch-and-bound algorithms for the set covering problem |
scientific article; zbMATH DE number 519589 |
Statements
Experiments with parallel branch-and-bound algorithms for the set covering problem (English)
0 references
26 June 1994
0 references
parallel processing
0 references
set covering
0 references
parallel multi-task model
0 references
integer optimization
0 references
branch-and-bound algorithms
0 references
subgradient optimization
0 references
Lagrangian relaxation
0 references
0 references
0 references
0.803744375705719
0 references
0.7997034192085266
0 references
