Network location of a reliable center using the most reliable route policy
From MaRDI portal
Publication:960392
DOI10.1016/j.cor.2008.02.007zbMath1175.90128OpenAlexW2026839440MaRDI QIDQ960392
Emanuel Melachrinoudis, Mary E. Helander, José A. Santiváñez
Publication date: 17 December 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.02.007
Stochastic programming (90C15) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)
Related Items (5)
A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs ⋮ Reliable maximin-maxisum locations for maximum service availability on tree networks vulnerable to disruptions ⋮ The approximability of multiple facility location on directed networks with random arc failures ⋮ On the location of a constrained \(k\)-tree facility in a tree network with unreliable edges ⋮ An Edge-Turbulence Algorithm for the 2-MRS Problem on Trees with Unreliable Edges
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A probabilistic FLEET model with individual vehicle reliability requirements
- The maximum reliability location problem and \(\alpha\)-reliable p-center problem: Derivatives of the probabilistic location set covering problem
- A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges
- An \(O(mn)\) algorithm for the 1-maximin problem on a network
- Optimal location of facilities on a network with an unreliable node or link
- Locating service facilities whose reliability is distance dependent.
- Towards unified formulations and extensions of two classical probabilistic location models
- The Maximal Expected Covering Location Problem: Revisited
- Heuristic Solution Methods for Two Location Problems with Unreliable Facilities
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Reliability covering problems
- Location of facilities on a network subject to a single‐edge failure
- Facility Location and Reliable Route Planning in Hazardous Material Transportation
- A probabilistic one-centre location problem on a network
- The Maximum Availability Location Problem
- A single facility location problem on a tree with unreliable edges
- Letter to the Editor—Optimum Locations on Graphs with Correlated Normal Demands
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Locating A Broadcast Facility In An Unreliable Network
- On solving unreliable planar location problems
This page was built for publication: Network location of a reliable center using the most reliable route policy
