Reliability problems in multiple path-shaped facility location on networks

DOI10.1016/j.disopt.2014.01.003zbMath1308.90091OpenAlexW2081344300WikidataQ58217141 ScholiaQ58217141MaRDI QIDQ2339811

Federica Ricca, Andrea Scozzari, Justo Puerto

Publication date: 9 April 2015

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2014.01.003

zbMATH Keywords

network locationmultifacility path locationpath-shaped facilitiesreliable location

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (8)

Extensive facility location problems on networks: an updated review ⋮ Two Paths Location of a Tree with Positive or Negative Weights ⋮ On fixed-parameter solvability of the minimax path location problem ⋮ Two paths location of a tree with positive or negative weights ⋮ An exact approach for the reliable fixed-charge location problem with capacity constraints ⋮ Uniform and most uniform partitions of trees ⋮ Optimization algorithms for resilient path selection in networks ⋮ On the location of a constrained \(k\)-tree facility in a tree network with unreliable edges

Cites Work

• Unnamed Item
• Unnamed Item
• Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification
• Range minimization problems in path-facility location on trees
• Comparing different metaheuristic approaches for the median path problem with bounded length
• Extensive facility location problems on networks with equity measures
• Improved algorithms for several network location problems with equality measures.
• Locating tree-shaped facilities using the ordered median objective
• Deterministic network interdiction
• Revisiting a game theoretic framework for the robust railway network design against intentional attacks
• The location of median paths on grid graphs
• An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
• Finding a 2-Core of a Tree in Linear Time
• The Reliable Facility Location Problem: Formulations, Heuristics, and Approximation Algorithms
• Locating median paths on connected outerplanar graphs
• Reliable Facility Location Design Under the Risk of Disruptions
• Minimax regret path location on trees
• On locating path- or tree-shaped facilities on networks
• Optimal location of a path or tree on a network with cycles
• Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects
• Two-Stage Robust Network Flow and Design Under Demand Uncertainty
• Heuristic Solution Methods for Two Location Problems with Unreliable Facilities
• A linear algorithm for a core of a tree
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Hamilton Paths in Grid Graphs
• The continuous and discrete path‐variance problems on trees
• Design of Survivable Networks: A survey
• Conditional location of path and tree shaped facilities on trees
• An Approach to Location Models Involving Sets as Existing Facilities

This page was built for publication: Reliability problems in multiple path-shaped facility location on networks