On solving unreliable planar location problems
From MaRDI portal
Publication:5926602
DOI10.1016/S0305-0548(99)00120-3zbMath0976.90060WikidataQ126382481 ScholiaQ126382481MaRDI QIDQ5926602
Publication date: 13 May 2001
Published in: Computers \& Operations Research (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (13)
Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing ⋮ Prepositioning supplies in preparation for disasters ⋮ OR/MS research in disaster operations management ⋮ Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach ⋮ A hybrid Markov process-mathematical programming approach for joint location-inventory problem under supply disruptions ⋮ A bilevel mixed-integer program for critical infrastructure protection planning ⋮ 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 defensive maximal covering problem on a network ⋮ Hub interdiction problem variants: models and metaheuristic solution algorithms ⋮ Location problems with continuous demand and unreliable facilities: applications of families of incremental Voronoi diagrams ⋮ Stochastic Analysis in Location Research ⋮ Probability chains: a general linearization technique for modeling reliability in facility location and related problems
Cites Work
- Unnamed Item
- A new bounding method for single facility location models
- Fast primal and dual heuristics for the \(p\)-median location problem
- The queueing maximal availability location problem: A model for the siting of emergency vehicles
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem
- An efficient tabu search procedure for the \(p\)-median problem
- A dynamic programming heuristic for the \(P\)-median problem
- Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach
- A note on convergence in the single facility minisum location problem
- On the conditional \(p\)-median problem
- On a rational stopping rule for facilities location algorithms
- Heuristic Solution Methods for Two Location Problems with Unreliable Facilities
- Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space
- An Overview of Representative Problems in Location Research
- Technical Note—A Generalized Bounding Method for Multifacility Location Models
- Location-Allocation Problems
- Worst-Case and Probabilistic Analysis of a Geometric Location Problem
- A Cut Approach to the Rectilinear Distance Facility Location Problem
- The Plant Location Problem: New Models and Research Prospects
- A new heuristic approach for the P-median problem
- Heuristic Methods for Location-Allocation Problems
- Bounding methods for facilities location algorithms
- On the Convergence of a Numerical Scheme for Solving Some Locational Equilibrium Problems
- Exact and approximate solutions to the multisource weber problem
This page was built for publication: On solving unreliable planar location problems
