Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem (Q490197): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10479-012-1221-3 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2028634810 / rank | |||
Normal rank |
Revision as of 18:20, 19 March 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