Unreliable point facility location problems on networks
From MaRDI portal
Publication:2636810
DOI10.1016/j.dam.2013.10.013zbMath1283.05258OpenAlexW2059679009WikidataQ58217147 ScholiaQ58217147MaRDI QIDQ2636810
Andrea Scozzari, Federica Ricca, Justo Puerto
Publication date: 18 February 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.10.013
Programming involving graphs or networks (90C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Discrete location and assignment (90B80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The multi-facility median problem with Pos/Neg weights on general graphs
- Range minimization problems in path-facility location on trees
- On the exponential cardinality of FDS for the ordered \(p\)-median problem
- Probabilistic analysis of failures in power transmission networks and phase transitions: Study case of a high-voltage power transmission network
- Extensive facility location problems on networks with equity measures
- Distribution systems design with role dependent objectives
- Incorporating congestion in preventive healthcare facility network design
- Geometric algorithms and combinatorial optimization.
- New bounds for lower envelopes in three dimensions, with applications to visibility in terrains
- Almost tight upper bounds for lower envelopes in higher dimensions
- Algorithmic results for ordered median problems
- The \(p\)-facility ordered median problem on networks
- The Reliable Facility Location Problem: Formulations, Heuristics, and Approximation Algorithms
- Reliable Facility Location Design Under the Risk of Disruptions
- Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects
- Locating Servers for Reliability and Affine Embeddings
- Heuristic Solution Methods for Two Location Problems with Unreliable Facilities
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Finite Dominating Sets for Network Location Problems
- A Simple Method for Reliability Evaluation of a Communication System
- Multifacility ordered median problems on networks: A further analysis
- The continuous and discrete path‐variance problems on trees
- Design of Survivable Networks: A survey
- Robust, Generic and Efficient Construction of Envelopes of Surfaces in Three-Dimensional Spaces
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
