Location of facilities on a network subject to a single‐edge failure
From MaRDI portal
Publication:3993631
DOI10.1002/net.3230220303zbMath0766.90052OpenAlexW2119252805MaRDI QIDQ3993631
Michel Gendreau, H. A. Eiselt, Gilbert Laporte
Publication date: 23 July 1992
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230220303
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Communication networks in operations research (90B18) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
On the Parameterized Complexity of the Expected Coverage Problem, On the parameterized complexity of the expected coverage problem, A DIVIDE-AND-CONQUER ALGORITHM FOR FINDING A MOST RELIABLE SOURCE ON A RING-EMBEDDED TREE NETWORK WITH UNRELIABLE EDGES, Optimal location of facilities on a network with an unreliable node or link, Emergency facility location under random network damage: insights from the Istanbul case, 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, Location Science in Canada, The approximability of multiple facility location on directed networks with random arc failures, A stochastic programming approach for Shelter location and evacuation planning, Network location of a reliable center using the most reliable route policy, Optimal placement of data replicas in distributed database with majority voting protocol, 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
Cites Work
