Constrained Location and the Weber-Rawls Problem

DOI10.1016/S0304-0208(08)73463-7zbMath0469.90027OpenAlexW114364450MaRDI QIDQ3923906

Pierre Hansen, Dominique Peeters, Jacques-François Thisse

Publication date: 1981

Published in: North-Holland Mathematics Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-0208(08)73463-7

zbMATH Keywords

logisticsefficient algorithmconstrained locationmaximum distance constraintsPareto-optimal locationsWeber-Rawls problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Inventory, storage, reservoirs (90B05)

Related Items

Application of heuristic and metaheuristic algorithms in solving constrained Weber problem with feasible region bounded by arcs, Was Euclid an unnecessarily sophisticated psychologist?, Using tropical optimization to solve constrained minimax single-facility location problems with rectilinear distance, A geometrical solution for quadratic bicriteria location models, The multi-facility min-max Weber problem, An economic theory of public facilities in space