Incorporating waiting time in competitive location models
From MaRDI portal
Publication:883196
DOI10.1007/S11067-006-9006-3zbMATH Open1137.90599OpenAlexW2084024834MaRDI QIDQ883196FDOQ883196
Publication date: 31 May 2007
Published in: Networks and Spatial Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11067-006-9006-3
Approximation methods and heuristics in mathematical programming (90C59) Hierarchical games (including Stackelberg games) (91A65) Continuous location (90B85)
Cites Work
- On locating new facilities in a competitive environment
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances
- Equity models in planar location
- Title not available (Why is that?)
- Static competitive facility location: an overview of optimisation approaches.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Equilibrium store locations when consumers minimize travel time plus waiting time
- A Parametric Decomposition Approach for the Solution of Uncapacitated Location Problems
- Heuristic concentration: Two stage solution construction
Cited In (4)
Recommendations
- Facility location for market capture when users rank facilities by shorter travel and waiting times π π
- The maximum capture problem with random utilities: problem formulation and algorithms π π
- A new chance-constrained maximum capture location problem π π
- Customer allocation in maximum capture problems π π
- The maximum capture problem with heterogeneous customers π π
This page was built for publication: Incorporating waiting time in competitive location models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q883196)