An Algorithm for a Constrained Weber Problem

DOI10.1287/MNSC.28.11.1285MaRDI QIDQ3657741zbMATH OpenOpenAlexFDO

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

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

zbMATH Keywords

algorithmcomputational experienceconstrained Weber problemfacility locationminimal transportation cost

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05) Nonlinear programming (90C30)

Cited in

(14)

• Region-rejection based heuristics for the capacitated multi-source Weber problem
• Finding shortest paths in the plane in the presence of barriers to travel (for any \(l_ p\)-norm)
• Was Euclid an unnecessarily sophisticated psychologist?
• Restricted center problems under polyhedral gauges
• Planar point-objecitve location problems with nonconvex constraints: A geometrical construction
• A multifacility location problem on median spaces
• Application of heuristic and metaheuristic algorithms in solving constrained Weber problem with feasible region bounded by arcs
• A characterization of efficient points in constrained location problems with regional demand
• A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand
• scientific article; zbMATH DE number 1507956 (Why is no real title available?)
• LARGE-SCALE SINGLE FACILITY CONTINUOUS LOCATION BY D.C. OPTIMIZATION
• Solving net-constrained clustering problem
• A continuous location-allocation problem with zone-dependent fixed cost
• Minisum location problem with farthest Euclidean distances

This page was built for publication: An Algorithm for a Constrained Weber Problem

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