Foundations of location analysis

DOI10.1007/978-1-4419-7572-0zbMath1351.90007OpenAlexW381492219MaRDI QIDQ708859

No author found.

Publication date: 15 October 2010

Published in: International Series in Operations Research \& Management Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/50846

Mathematics Subject Classification ID

Continuous location (90B85) Proceedings, conferences, collections, etc. pertaining to game theory, economics, and finance (91-06) Discrete location and assignment (90B80) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06) Spatial models in economics (91B72)

Related Items (44)

Robust equilibria in location games ⋮ Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms ⋮ Optimization of facility location and size problem based on bi-level multi-objective programming ⋮ Comparison of metaheuristics for the bilevel facility location and mill pricing problem ⋮ A survey of healthcare facility location ⋮ Approximating the Restricted 1-Center in Graphs ⋮ A new heuristic for solving the \(p\)-median problem in the plane ⋮ A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs ⋮ Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings ⋮ An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs ⋮ Mean-variance value at risk criterion for solving a \(p\)-median location problem on networks with type-2 intuitionistic fuzzy weights ⋮ Responsive make‐to‐order supply chain network design ⋮ The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights ⋮ Designing e‐commerce supply chains: a stochastic facility–location approach ⋮ A 16-competitive algorithm for hierarchical median problem ⋮ Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks ⋮ The extensive 1-median problem with radius on networks ⋮ Algebraic solution of minimax single-facility constrained location problems with Chebyshev and rectilinear distances ⋮ Integrating supplier selection decisions into an inventory location problem for designing the supply chain network ⋮ Approximating the restricted 1-center in graphs ⋮ The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction ⋮ Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks ⋮ Sequential competitive location on networks ⋮ Unnamed Item ⋮ Bilevel competitive facility location and pricing problems ⋮ Sequential Location Game on Continuous Directional Star Networks ⋮ Modeling and solution of maximal covering problem considering gradual coverage with variable radius over multi-periods ⋮ Classical and inverse median location problems under uncertain environment ⋮ Inverse anti-\(k\)-centrum problem on networks with variable edge lengths ⋮ Effects of multipurpose shopping trips on retail store location in a duopoly ⋮ Some polynomially solvable cases of the inverse ordered 1-median problem on trees ⋮ Multicriteria decision analysis for sustainable data centers location ⋮ Reverse 1-center problem on weighted trees ⋮ Using tropical optimization to solve constrained minimax single-facility location problems with rectilinear distance ⋮ Technical Note—The Competitive Facility Location Problem in a Duopoly: Advances Beyond Trees ⋮ A historical perspective on location problems ⋮ Optimal algorithms for selective variants of the classical and inverse median location problems on trees ⋮ A Branch-and-Price Algorithm for Facility Location with General Facility Cost Functions ⋮ The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem ⋮ The use of fuzzy logic in various combinatorial optimization problems ⋮ An approximation algorithm for the facility location problem with lexicographic minimax objective ⋮ The connected p-median problem on complete multi-layered graphs ⋮ Optimal Gathering of Oblivious Robots in Anonymous Graphs ⋮ On complexity of the bilevel location and pricing problems

This page was built for publication: Foundations of location analysis