Constrained Location and the Weber-Rawls Problem

DOI10.1016/S0304-0208(08)73463-7zbMATH Open0469.90027OpenAlexW114364450MaRDI QIDQ3923906FDOQ3923906

Authors: 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

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

Cited In (6)

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

This page was built for publication: Constrained Location and the Weber-Rawls Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3923906)