An Algorithm for a Constrained Weber Problem
From MaRDI portal
Publication:3657741
DOI10.1287/mnsc.28.11.1285zbMath0512.90038OpenAlexW2009238860MaRDI QIDQ3657741
Pierre Hansen, Jacques-François Thisse, Dominique Peeters
Publication date: 1982
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.28.11.1285
algorithmfacility locationcomputational experienceconstrained Weber problemminimal transportation cost
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Inventory, storage, reservoirs (90B05)
Related Items (13)
Planar point-objecitve location problems with nonconvex constraints: A geometrical construction ⋮ LARGE-SCALE SINGLE FACILITY CONTINUOUS LOCATION BY D.C. OPTIMIZATION ⋮ Minisum location problem with farthest Euclidean distances ⋮ A multifacility location problem on median spaces ⋮ A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand ⋮ Unnamed Item ⋮ Application of heuristic and metaheuristic algorithms in solving constrained Weber problem with feasible region bounded by arcs ⋮ Was Euclid an unnecessarily sophisticated psychologist? ⋮ Region-rejection based heuristics for the capacitated multi-source Weber problem ⋮ Restricted center problems under polyhedral gauges ⋮ A characterization of efficient points in constrained location problems with regional demand ⋮ Finding shortest paths in the plane in the presence of barriers to travel (for any \(l_ p\)-norm) ⋮ A continuous location-allocation problem with zone-dependent fixed cost
This page was built for publication: An Algorithm for a Constrained Weber Problem