Multiple facility location on a network with linear reliability order of edges
From MaRDI portal
Publication:1680498
DOI10.1007/s10878-017-0121-5zbMath1383.90019OpenAlexW2616598605MaRDI QIDQ1680498
F. Sibel Salman, Refael Hassin, R. Ravi
Publication date: 16 November 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-017-0121-5
Related Items (5)
On the Parameterized Complexity of the Expected Coverage Problem ⋮ On the parameterized complexity of the expected coverage problem ⋮ Robustifying humanitarian relief systems against travel time uncertainty ⋮ The approximability of multiple facility location on directed networks with random arc failures ⋮ An algorithm for solving the bi-objective median path-shaped facility on a tree network
Cites Work
- Emergency facility location under random network damage: insights from the Istanbul case
- Assessing the reliability and the expected performance of a network under disaster risk
- Greedoids
- A factor 2 approximation algorithm for the generalized Steiner network problem
- A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges
- Optimal location of facilities on a network with an unreliable node or link
- Pipage rounding: a new method of constructing algorithms with proven performance guarantee
- A threshold of ln n for approximating set cover
- Approximating minimum bounded degree spanning trees to within one of optimal
- Approximation Algorithms for the Set Covering and Vertex Cover Problems
- Location of facilities on a network subject to a single‐edge failure
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- A single facility location problem on a tree with unreliable edges
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Multiple facility location on a network with linear reliability order of edges
