Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem (Q490197): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:06, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem |
scientific article |
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
