Solution algorithms for the capacitated single allocation hub location problem (Q1290137)
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: Solution algorithms for the capacitated single allocation hub location problem |
scientific article; zbMATH DE number 1299344
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solution algorithms for the capacitated single allocation hub location problem |
scientific article; zbMATH DE number 1299344 |
Statements
Solution algorithms for the capacitated single allocation hub location problem (English)
0 references
10 June 1999
0 references
capacitated single allocation hub location
0 references
heuristic
0 references
simulated annealing
0 references
random descent
0 references
branch and bound
0 references
0.9504803
0 references
0.9390225
0 references
0.93556833
0 references
0.9294446
0 references
0.92245466
0 references
0.91939896
0 references
0.91745496
0 references
0.91732764
0 references
0.91721225
0 references
