Reliable maximin-maxisum locations for maximum service availability on tree networks vulnerable to disruptions
From MaRDI portal
Publication:2178373
DOI10.1007/s10479-018-2993-xzbMath1437.90095OpenAlexW2885549845MaRDI QIDQ2178373
José A. Santiváñez, Emanuel Melachrinoudis
Publication date: 11 May 2020
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-018-2993-x
location theorynetwork reliabilitynetwork availabilitybi-criteria decision makingcenter-median problem
Queues and service in operations research (90B22) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10) Inventory, storage, reservoirs (90B05) Discrete location and assignment (90B80)
Related Items
Reliable maximin-maxisum locations for maximum service availability on tree networks vulnerable to disruptions, Computing the execution probability of jobs with replication in mixed-criticality schedules
Cites Work
- Unnamed Item
- Unnamed Item
- The complexity of computing the permanent
- Network reliability: Numbers or insight? (A discussion paper)
- The maximum reliability location problem and \(\alpha\)-reliable p-center problem: Derivatives of the probabilistic location set covering problem
- The capacitated maximal covering location problem with backup service
- Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
- Network location of a reliable center using the most reliable route policy
- Network survivability modeling
- Towards unified formulations and extensions of two classical probabilistic location models
- Reliable maximin-maxisum locations for maximum service availability on tree networks vulnerable to disruptions
- The Maximal Expected Covering Location Problem: Revisited
- The Maximum Availability Location Problem
- A single facility location problem on a tree with unreliable edges
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- The maximin-maxisum network location problem