A single facility location problem on a tree with unreliable edges
DOI10.1002/(SICI)1097-0037(199605)27:3%3C219::AID-NET7%3E3.0.CO;2-LzbMATH Open0851.90074OpenAlexW2025973739MaRDI QIDQ4887754FDOQ4887754
Authors: Emanuel Melachrinoudis, Mary E. Helander 
Publication date: 25 November 1996
Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199605)27:3%3C219::aid-net7%3E3.0.co;2-l
Recommendations
- Reliability problems in multiple path-shaped facility location on networks
- Unreliable point facility location problems on networks
- Location of facilities on a network subject to a single‐edge failure
- On the location of a constrained \(k\)-tree facility in a tree network with unreliable edges
- Optimal location of facilities on a network with an unreliable node or link
Programming involving graphs or networks (90C35) Reliability, availability, maintenance, inspection in operations research (90B25) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)
Cited In (17)
- Reliability analysis of facility systems subject to edge failures: based on the uncapacitated fixed-charge location problem
- On the Parameterized Complexity of the Expected Coverage Problem
- A divide-and-conquer algorithm for finding a most reliable source on a ring-embedded tree network with unreliable edges
- Network location of a reliable center using the most reliable route policy
- On the parameterized complexity of the expected coverage problem
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
- On the 2-MRS problem in a tree with unreliable edges
- Location of facilities on a network subject to a single‐edge failure
- A linear time algorithm for computing a most reliable source on a tree network with faulty nodes
- Locating A Broadcast Facility In An Unreliable Network
- Emergency facility location under random network damage: insights from the Istanbul case
- Multiple facility location on a network with linear reliability order of edges
- A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges
- 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
- An Edge-Turbulence Algorithm for the 2-MRS Problem on Trees with Unreliable Edges
This page was built for publication: A single facility location problem on a tree with unreliable edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4887754)
