Minimax regret 1-sink location problem with accessibility in dynamic general networks

DOI10.1016/j.ejor.2015.09.022zbMath1346.90504OpenAlexW1715110731MaRDI QIDQ322462

Hong-Mei Li, Yin-Feng Xu

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.09.022

zbMATH Keywords

accessibilityalgorithmminimax regretlocationgeneral network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Related Items (3)

Multiple sink location problem in path networks with a combinational objective ⋮ Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights ⋮ Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities

Cites Work

• Minmax regret 1-facility location on uncertain path networks
• Minimax regret 1-sink location problem in dynamic cycle networks
• An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks
• Improved algorithms for computing minmax regret sinks on dynamic path and tree networks
• Minimax regret 1-sink location problem in dynamic path networks
• Minimax Regret 1-Sink Location Problems in Dynamic Path Networks
• Minimax Regret k-sink Location Problem in Dynamic Path Networks
• Multiple Sink Location Problems in Dynamic Path Networks
• Faster all-pairs shortest paths via circuit complexity
• Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity

This page was built for publication: Minimax regret 1-sink location problem with accessibility in dynamic general networks