Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems (Q336701): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B80 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C59 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6650540 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
location-allocation | |||
Property / zbMATH Keywords: location-allocation / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
transportation | |||
Property / zbMATH Keywords: transportation / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
branch and bound | |||
Property / zbMATH Keywords: branch and bound / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
beam search | |||
Property / zbMATH Keywords: beam search / rank | |||
Normal rank |
Revision as of 05:17, 28 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems |
scientific article |
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