On solving unreliable planar location problems
From MaRDI portal
Recommendations
- Facility location on planar graphs with unreliable links
- scientific article; zbMATH DE number 849181
- Facility location problems with uncertainty on the plane
- Unreliable point facility location problems on networks
- Error bounds for the approximative solution of restricted planar location problems
- scientific article; zbMATH DE number 1617272
- A robust and efficient algorithm for planar competitive location problems
- Multicriteria planar location problems
Cites work
- scientific article; zbMATH DE number 3027356 (Why is no real title available?)
- A Cut Approach to the Rectilinear Distance Facility Location Problem
- A dynamic programming heuristic for the \(P\)-median problem
- A new bounding method for single facility location models
- A new heuristic approach for the P-median problem
- A note on convergence in the single facility minisum location problem
- An Overview of Representative Problems in Location Research
- An efficient tabu search procedure for the p-median problem
- Bounding methods for facilities location algorithms
- Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach
- Exact and approximate solutions to the multisource weber problem
- Fast primal and dual heuristics for the \(p\)-median location problem
- Heuristic Methods for Location-Allocation Problems
- Heuristic Solution Methods for Two Location Problems with Unreliable Facilities
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem
- Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space
- Location-Allocation Problems
- On a rational stopping rule for facilities location algorithms
- On the Convergence of a Numerical Scheme for Solving Some Locational Equilibrium Problems
- On the conditional \(p\)-median problem
- Technical Note—A Generalized Bounding Method for Multifacility Location Models
- The Plant Location Problem: New Models and Research Prospects
- The queueing maximal availability location problem: A model for the siting of emergency vehicles
- Worst-Case and Probabilistic Analysis of a Geometric Location Problem
Cited in
(17)- Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
- On solving the discrete location problems when the facilities are prone to failure
- Network location of a reliable center using the most reliable route policy
- A hybrid Markov process-mathematical programming approach for joint location-inventory problem under supply disruptions
- Hub interdiction problem variants: models and metaheuristic solution algorithms
- Location problems with continuous demand and unreliable facilities: applications of families of incremental Voronoi diagrams
- Multi-objective evolutionary algorithms for a reliability location problem
- Prepositioning supplies in preparation for disasters
- Unreliable point facility location problems on networks
- Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach
- A bilevel mixed-integer program for critical infrastructure protection planning
- Using estimated missing spatial data with the 2-median model
- Stochastic analysis in location research
- A defensive maximal covering problem on a network
- Probability chains: a general linearization technique for modeling reliability in facility location and related problems
- OR/MS research in disaster operations management
- Spatial uncertainties in continuous location problems
This page was built for publication: On solving unreliable planar location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5926602)
