Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems (Q336701)
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: Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems |
scientific article; zbMATH DE number 6650540
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems |
scientific article; zbMATH DE number 6650540 |
Statements
Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems (English)
0 references
10 November 2016
0 references
location-allocation
0 references
transportation
0 references
branch and bound
0 references
beam search
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8631556630134583
0 references
0.8558359742164612
0 references
0.8529757261276245
0 references
0.837996780872345
0 references
