Minimax regret 1-sink location problem in dynamic cycle networks

DOI10.1016/J.IPL.2014.09.006zbMath1302.90105OpenAlexW1990351612MaRDI QIDQ477612

Yin-Feng Xu, Hong-Mei Li

Publication date: 9 December 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.09.006

zbMATH Keywords

algorithmsminimax regretsink locationcycle network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (4)

Multiple sink location problem in path networks with a combinational objective ⋮ Minimax regret 1-sink location problem with accessibility in dynamic general networks ⋮ Improved algorithms for computing minmax regret sinks on dynamic path and tree networks ⋮ Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities

Cites Work

• An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks
• Minmax Regret 1-Facility Location on Uncertain 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
• Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity

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