Location science research: a review
From MaRDI portal
Publication:1417700
DOI10.1023/A:1026110926707zbMath1137.90598OpenAlexW86242020MaRDI QIDQ1417700
Christopher R. Moberg, Trevor S. Hale
Publication date: 5 January 2004
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1026110926707
Related Items (37)
Solving a location problem of a Stackelberg firm competing with Cournot-Nash firms ⋮ Variable neighborhood search for the pharmacy duty scheduling problem ⋮ A hybrid method for the probabilistic maximal covering location-allocation problem ⋮ A Lagrangian heuristic algorithm for a public healthcare facility location problem ⋮ A fuzzy multi-objective programming for optimization of fire station locations through genetic algorithms ⋮ A decomposition heuristic for the maximal covering location problem ⋮ Constant work-space algorithms for facility location problems ⋮ Solving a minisum single facility location problem in three regions with different norms ⋮ Does Euclidean distance work well when the \(p\)-median model is applied in rural areas? ⋮ Sequential competitive location on networks ⋮ Transport economies of scale and firm location ⋮ Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design ⋮ Algorithms for location problems based on angular distances ⋮ OR models in urban service facility location: a critical review of applications and future developments ⋮ A linear time algorithm for computing minmax regret 1-median on a tree network ⋮ Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding ⋮ Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks ⋮ Optimal placement of wireless charging lanes in road networks ⋮ Solving continuous location-districting problems with Voronoi diagrams ⋮ Modeling health care facility location for moving population groups ⋮ New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems ⋮ A branch and bound algorithm for determining locations of long-term care facilities ⋮ Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network ⋮ An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem ⋮ Data-driven distributionally robust capacitated facility location problem ⋮ Public facility location using dispersion, population, and equity criteria ⋮ Alternative fuel station location model with demand learning ⋮ MapReduce based location selection algorithm for utility maximization with capacity constraints ⋮ A dual simplex-type algorithm for the smallest enclosing ball of balls ⋮ Pharmacy duty scheduling problem ⋮ A decomposition approach for the probabilistic maximal covering location-allocation problem ⋮ Aggregation error for location models: Survey and analysis ⋮ The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem ⋮ OPEN PROBLEMS IN COOPERATIVE LOCATION GAMES ⋮ Median Problems in Networks ⋮ A multiobjective optimization approach for location‐allocation of clinics ⋮ Distance measure and the \(p\)-median problem in rural areas
This page was built for publication: Location science research: a review
