Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem (Q490197)
From MaRDI portal
!
WARNING
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 6389160
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem |
scientific article; zbMATH DE number 6389160 |
Statements
Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem (English)
0 references
22 January 2015
0 references
branch and bound
0 references
discrete approximation
0 references
facility location-allocation
0 references
transportation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8869619965553284
0 references
0.8642445206642151
0 references
0.8529757261276245
0 references
0.8484426736831665
0 references
