Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations

DOI10.1016/j.cor.2008.08.003zbMath1158.90374MaRDI QIDQ1013385

J. Martínez

Publication date: 17 April 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.08.003

zbMATH Keywords

heuristics; capacitated multisource Weber problem; probabilistic customer locations

Mathematics Subject Classification ID

90B85: Continuous location

90C59: Approximation methods and heuristics in mathematical programming