Network location of a reliable center using the most reliable route policy
DOI10.1016/J.COR.2008.02.007zbMATH Open1175.90128OpenAlexW2026839440MaRDI QIDQ960392FDOQ960392
José A. Santiváñez, Emanuel Melachrinoudis, Mary E. Helander
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
Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25) Stochastic programming (90C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Locating service facilities whose reliability is distance dependent.
- Heuristic Solution Methods for Two Location Problems with Unreliable Facilities
- On solving unreliable planar location problems
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Reliability covering problems
- Towards unified formulations and extensions of two classical probabilistic location models
- The Maximal Expected Covering Location Problem: Revisited
- The Maximum Availability Location Problem
- Facility Location and Reliable Route Planning in Hazardous Material Transportation
- Optimal location of facilities on a network with an unreliable node or link
- Location of facilities on a network subject to a single‐edge failure
- A single facility location problem on a tree with unreliable edges
- Letter to the Editor—Optimum Locations on Graphs with Correlated Normal Demands
- 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
- Locating A Broadcast Facility In An Unreliable Network
- A probabilistic FLEET model with individual vehicle reliability requirements
- A probabilistic one-centre location problem on a network
- An \(O(mn)\) algorithm for the 1-maximin problem on a network
Cited In (8)
- Trade-offs on the location of the core node in a network
- Strategy-proof location on a network
- A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs
- On the location of a constrained \(k\)-tree facility in a tree network with unreliable edges
- 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
- How to Allocate Network Centers
- An Edge-Turbulence Algorithm for the 2-MRS Problem on Trees with Unreliable Edges
This page was built for publication: Network location of a reliable center using the most reliable route policy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960392)
