How much the grid network and rescuers' communication can improve the rescue efficiency in worst-case analysis

DOI10.1007/s10878-013-9681-1zbMath1327.90044OpenAlexW2055653747MaRDI QIDQ887851

Hui-Li Zhang, Yin-Feng Xu

Publication date: 3 November 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-013-9681-1

zbMATH Keywords

shortest pathworst-case analysisroutinggrid networkrescuers' communication

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Related Items (1)

A scheduling algorithm for medical emergency rescue aircraft trajectory based on hybrid estimation and intent inference

Cites Work

• The computational complexity of the relative robust shortest path problem with interval data
• On finding dissimilar Pareto-optimal paths
• Reduction approaches for robust shortest path problems
• The dynamic shortest path problem with anticipation
• The Canadian Traveller Problem and its competitive analysis
• An exact algorithm for the robust shortest path problem with interval data
• On finding dissimilar paths
• The \(k\)-Canadian travelers problem with communication
• An efficient algorithm for K shortest simple paths
• Finding the k Shortest Paths
• Finding the K Shortest Loopless Paths in a Network

This page was built for publication: How much the grid network and rescuers' communication can improve the rescue efficiency in worst-case analysis