Stochastic multi-facility minisum location problem involving Euclidean distances
From MaRDI portal
Publication:1066794
zbMath0578.90023MaRDI QIDQ1066794
Publication date: 1985
Published in: Opsearch (Search for Journal in Brave)
computational experienceEuclidean distancesbivariate symmetric exponential distributionoptimal global solutionstochastic multi-facility minisum location
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Inventory, storage, reservoirs (90B05)
Related Items (2)
Location models with stochastic demand points ⋮ A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations
This page was built for publication: Stochastic multi-facility minisum location problem involving Euclidean distances