Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem (Q490197): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/S10479-012-1221-3 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10479-012-1221-3 / rank | |||
Normal rank | |||
Latest revision as of 19:10, 9 December 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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
