Reliable maximin-maxisum locations for maximum service availability on tree networks vulnerable to disruptions

DOI10.1007/S10479-018-2993-XMaRDI QIDQ2178373zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

location theorynetwork reliabilitynetwork availabilitybi-criteria decision makingcenter-median problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Queues and service in operations research (90B22) Reliability, availability, maintenance, inspection in operations research (90B25) Inventory, storage, reservoirs (90B05) Discrete location and assignment (90B80)

Recommendations

• A single facility location problem on a tree with unreliable edges
• Optimal location of facilities on a network with an unreliable node or link
• Network location of a reliable center using the most reliable route policy
• Unreliable point facility location problems on networks
• Reliable facility location design under disruptions

Cites work

• scientific article; zbMATH DE number 51430 (Why is no real title available?)
• A single facility location problem on a tree with unreliable edges
• Introduction to algorithms
• 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 reliability: Numbers or insight? (A discussion paper)
• Network survivability modeling
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• 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
• The capacitated maximal covering location problem with backup service
• The complexity of computing the permanent
• The maximin-maxisum network location problem
• The maximum reliability location problem and \(\alpha\)-reliable p-center problem: Derivatives of the probabilistic location set covering problem
• Towards unified formulations and extensions of two classical probabilistic location models

Cited in

(4)

• Computing the execution probability of jobs with replication in mixed-criticality schedules
• Reliable maximin-maxisum locations for maximum service availability on tree networks vulnerable to disruptions
• Accumulation Point Location on Tree Networks for Guaranteed Time Distribution
• Availability-based path selection and network vulnerability assessment

This page was built for publication: Reliable maximin-maxisum locations for maximum service availability on tree networks vulnerable to disruptions

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