A co-operative parallel heuristic for mixed zero--one linear programming: Combining simulated annealing with branch and bound (Q707082)
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 2132748
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A co-operative parallel heuristic for mixed zero--one linear programming: Combining simulated annealing with branch and bound |
scientific article; zbMATH DE number 2132748 |
Statements
A co-operative parallel heuristic for mixed zero--one linear programming: Combining simulated annealing with branch and bound (English)
0 references
9 February 2005
0 references
Branch and bound
0 references
Integer programming
0 references
Metaheuristics
0 references
Parallel computing
0 references
Simulated annealing
0 references
0 references
0 references
0 references
0.7898566722869873
0 references
0.7698085308074951
0 references
0.7688696980476379
0 references
0.7658053040504456
0 references
