A single facility location problem on a tree with unreliable edges
From MaRDI portal
Publication:4887754
DOI<219::AID-NET7>3.0.CO;2-L 10.1002/(SICI)1097-0037(199605)27:3<219::AID-NET7>3.0.CO;2-LzbMath0851.90074OpenAlexW2025973739MaRDI QIDQ4887754
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<219::aid-net7>3.0.co;2-l
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Reliability, availability, maintenance, inspection in operations research (90B25) Discrete location and assignment (90B80)
Related Items (13)
On the Parameterized Complexity of the Expected Coverage Problem ⋮ On the parameterized complexity of the expected coverage problem ⋮ A quadratic time exact algorithm for continuous connected 2-facility location problem in trees ⋮ A DIVIDE-AND-CONQUER ALGORITHM FOR FINDING A MOST RELIABLE SOURCE ON A RING-EMBEDDED TREE NETWORK WITH UNRELIABLE EDGES ⋮ Emergency facility location under random network damage: insights from the Istanbul case ⋮ Reliable maximin-maxisum locations for maximum service availability on tree networks vulnerable to disruptions ⋮ Multiple facility location on a network with linear reliability order of edges ⋮ A linear time algorithm for computing a most reliable source on a tree network with faulty nodes ⋮ The approximability of multiple facility location on directed networks with random arc failures ⋮ Network location of a reliable center using the most reliable route policy ⋮ On the location of a constrained \(k\)-tree facility in a tree network with unreliable edges ⋮ A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges ⋮ 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
