The single facility location problem with average-distances

DOI10.1007/S11750-008-0040-9MaRDI QIDQ1024705zbMATH OpenOpenAlexFDO

Authors Antonio M. Rodríguez-Chía, I. Espejo Miranda, C. Valero-Franco

Publication date 17 June 2009

Published in Top (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11750-008-0040-9

zbMATH Keywords

Weber problemWeiszfeld algorithmaverage distance

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Continuous location (90B85)

Recommendations

• On the structure of the solution set for the single facility location problem with average distances
• A probabilistic minimax location problem on the plane
• A 1-center problem on the plane with uniformly distributed demand points
• Asymptotic of an optimal location problem
• OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS

Cites work

• scientific article; zbMATH DE number 1423921 (Why is no real title available?)
• scientific article; zbMATH DE number 3209277 (Why is no real title available?)
• A New Distance Function for Modeling Travel Distances in a Transportation Network
• An Approach to Location Models Involving Sets as Existing Facilities
• Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
• Locating facilities by minimax relative to closest points of demand areas
• Location and shape of a rectangular facility in \(\mathbb{R}^n\). Convexity properties
• Location of a moving service facility
• Location of regional facilities
• Mathematical Models of Road Travel Distances
• New models for locating a moving service facility
• ON THE LAMÉ POINT AND ITS GENERALIZATIONS IN A NORMED SPACE
• Optimal location of a facility relative to area demands
• Optimal location of a single facility with circular demand areas
• The Weber problem with regional demand
• The generalized Weber problem with expected distances

Cited in

(7)

• A 1-center problem on the plane with uniformly distributed demand points
• Asymptotic of an optimal location problem
• On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\)
• Facility location problems on graphs with non-convex neighborhoods
• On the structure of the solution set for the single facility location problem with average distances
• Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
• Accelerating convergence in minisum location problem with \(\ell p\) norms

This page was built for publication: The single facility location problem with average-distances

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