Pages that link to "Item:Q1417700"

The following pages link to Location science research: a review (Q1417700):

Displaying 25 items.

• Solving a location problem of a Stackelberg firm competing with Cournot-Nash firms (Q301071) (← links)
• Variable neighborhood search for the pharmacy duty scheduling problem (Q337137) (← links)
• A hybrid method for the probabilistic maximal covering location-allocation problem (Q337483) (← links)
• A Lagrangian heuristic algorithm for a public healthcare facility location problem (Q363567) (← links)
• Sequential competitive location on networks (Q439407) (← links)
• Transport economies of scale and firm location (Q459402) (← links)
• Algorithms for location problems based on angular distances (Q471721) (← links)
• A linear time algorithm for computing minmax regret 1-median on a tree network (Q486974) (← links)
• Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding (Q490221) (← links)
• Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks (Q496433) (← links)
• A decomposition heuristic for the maximal covering location problem (Q606191) (← links)
• A fuzzy multi-objective programming for optimization of fire station locations through genetic algorithms (Q877079) (← links)
• Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design (Q925847) (← links)
• Solving continuous location-districting problems with Voronoi diagrams (Q947939) (← links)
• New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems (Q959511) (← links)
• A branch and bound algorithm for determining locations of long-term care facilities (Q976416) (← links)
• A decomposition approach for the probabilistic maximal covering location-allocation problem (Q1017444) (← links)
• Aggregation error for location models: Survey and analysis (Q1026594) (← links)
• OR models in urban service facility location: a critical review of applications and future developments (Q1728469) (← links)
• Does Euclidean distance work well when the \(p\)-median model is applied in rural areas? (Q1945072) (← links)
• Optimal placement of wireless charging lanes in road networks (Q1983692) (← links)
• Data-driven distributionally robust capacitated facility location problem (Q2030664) (← links)
• A dual simplex-type algorithm for the smallest enclosing ball of balls (Q2044498) (← links)
• A multiobjective optimization approach for location‐allocation of clinics (Q5252217) (← links)
• Solving a minisum single facility location problem in three regions with different norms (Q6157224) (← links)