Weber problems with mixed distances and regional demand

DOI10.1007/S00186-007-0165-XMaRDI QIDQ2465384zbMATH OpenOpenAlexWikidataFDO

Authors Martin Gugat, B. Pfeiffer

Publication date 4 January 2008

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00186-007-0165-x

zbMATH Keywords

facility planningmixed distanceregional demandstochastic optimizationWeber problem

Mathematics Subject Classification ID

Continuous location (90B85) Stochastic programming (90C15) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• The generalized Weber problem with expected distances
• Single facility location problem with region-dependent distance metrics
• The Weber problem with regional demand
• scientific article; zbMATH DE number 279289
• BILINEAR PROGRAMMING FORMULATIONS FOR WEBER PROBLEMS WITH CONTINUOUS AND NETWORK DISTANCES

Cites work

• A characterization of efficient points in constrained location problems with regional demand
• A linearization method for mixed 0--1 polynomial programs
• Approximate formulas of average distances associated with regions and their applications to location problems
• BILINEAR PROGRAMMING FORMULATIONS FOR WEBER PROBLEMS WITH CONTINUOUS AND NETWORK DISTANCES
• scientific article; zbMATH DE number 47153 (Why is no real title available?)
• scientific article; zbMATH DE number 5025426 (Why is no real title available?)
• Location Theory, Dominance, and Convexity
• On the Continuous Fermat-Weber Problem
• The Weber problem with regional demand
• Weber problems with alternative transportation systems

Cited in

(14)

• On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems
• Mixed planar/network facility location problems
• Corrigendum to ``Simultaneous location of a service facility and a rapid transit line [Computers \& Operations Research 38 (2) (2011) 525-538]
• Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances
• A unified model for Weber problems with continuous and network distances
• The Weber problem in congested regions with entry and exit points
• Continuous location of an assembly station
• Single facility location problem with region-dependent distance metrics
• Algorithms for location problems based on angular distances
• The generalized Weber problem with expected distances
• Weber problems with high-speed lines
• The location problem for compressor stations in pipeline networks
• Simultaneous location of a service facility and a rapid transit line
• The maximin line problem with regional demand

This page was built for publication: Weber problems with mixed distances and regional demand

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