Reliability problems in multiple path-shaped facility location on networks

DOI10.1016/J.DISOPT.2014.01.003zbMATH Open1308.90091OpenAlexW2081344300WikidataQ58217141 ScholiaQ58217141MaRDI QIDQ2339811FDOQ2339811

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

Recommendations

• Multiple facility location on a network with linear reliability order of edges
• Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links
• Unreliable point facility location problems on networks
• Optimal location of facilities on a network with an unreliable node or link
• The reliable facility location problem: formulations, heuristics, and approximation algorithms
• Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects
• Facility location on planar graphs with unreliable links
• The approximability of multiple facility location on directed networks with random arc failures
• An approximation algorithm for reliable facility location problem
• A general model and efficient algorithms for reliable facility location problem under uncertain disruptions

zbMATH Keywords

network locationmultifacility path locationpath-shaped facilitiesreliable location

Mathematics Subject Classification ID

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

Cites Work

• 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
• Heuristic Solution Methods for Two Location Problems with Unreliable Facilities
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Hamilton Paths in Grid Graphs
• Design of Survivable Networks: A survey
• Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification
• Deterministic network interdiction
• An Approach to Location Models Involving Sets as Existing Facilities
• Revisiting a game theoretic framework for the robust railway network design against intentional attacks
• An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
• Range minimization problems in path-facility location on trees
• Comparing different metaheuristic approaches for the median path problem with bounded length
• Two-Stage Robust Network Flow and Design Under Demand Uncertainty
• Improved algorithms for several network location problems with equality measures.
• Locating tree-shaped facilities using the ordered median objective
• Conditional location of path and tree shaped facilities on trees
• A linear algorithm for a core of a tree
• 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
• Extensive facility location problems on networks with equity measures
• Locating median paths on connected outerplanar graphs
• The continuous and discrete path‐variance problems on trees
• Title not available (Why is that?)
• The location of median paths on grid graphs
• Finding a 2-core of a tree in linear time
• Title not available (Why is that?)

Cited In (13)

• Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links
• Extensive facility location problems on networks: an updated review
• An exact approach for the reliable fixed-charge location problem with capacity constraints
• Location of facilities on a network subject to a single‐edge failure
• Uniform and most uniform partitions of trees
• Optimization algorithms for resilient path selection in networks
• Two Paths Location of a Tree with Positive or Negative Weights
• A single facility location problem on a tree with unreliable edges
• Two paths location of a tree with positive or negative weights
• The reliable facility location problem: formulations, heuristics, and approximation algorithms
• On fixed-parameter solvability of the minimax path location problem
• Multiple facility location on a network with linear reliability order of edges
• On the location of a constrained \(k\)-tree facility in a tree network with unreliable edges

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2339811)