Network location of a reliable center using the most reliable route policy
From MaRDI portal
(Redirected from Publication:960392)
Recommendations
- A single facility location problem on a tree with unreliable edges
- Locating A Broadcast Facility In An Unreliable Network
- Unreliable point facility location problems on networks
- Linking-Centers and Reliable-Trees of a Network
- Optimal location of facilities on a network with an unreliable node or link
Cites work
- scientific article; zbMATH DE number 49666 (Why is no real title available?)
- scientific article; zbMATH DE number 1063797 (Why is no real title available?)
- A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges
- A probabilistic FLEET model with individual vehicle reliability requirements
- A probabilistic one-centre location problem on a network
- A single facility location problem on a tree with unreliable edges
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An \(O(mn)\) algorithm for the 1-maximin problem on a network
- Facility Location and Reliable Route Planning in Hazardous Material Transportation
- Heuristic Solution Methods for Two Location Problems with Unreliable Facilities
- Letter to the Editor—Optimum Locations on Graphs with Correlated Normal Demands
- Locating A Broadcast Facility In An Unreliable Network
- Locating service facilities whose reliability is distance dependent.
- Location of facilities on a network subject to a single‐edge failure
- Network flows. Theory, algorithms, and applications.
- On solving unreliable planar location problems
- Optimal location of facilities on a network with an unreliable node or link
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Reliability covering problems
- The Maximal Expected Covering Location Problem: Revisited
- The Maximum Availability Location Problem
- The maximum reliability location problem and \(\alpha\)-reliable p-center problem: Derivatives of the probabilistic location set covering problem
- Towards unified formulations and extensions of two classical probabilistic location models
Cited in
(9)- An edge-turbulence algorithm for the 2-MRS problem on trees with unreliable edges
- Trade-offs on the location of the core node in a network
- Strategy-proof location on a network
- Locating A Broadcast Facility In An Unreliable 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
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)
