Minimax regret 1-sink location problem in dynamic cycle networks

DOI10.1016/J.IPL.2014.09.006MaRDI QIDQ477612zbMATH OpenOpenAlexFDO

Authors Yinfeng Xu, Hongmei 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)

Recommendations

• Minimax regret 1-sink location problem with accessibility in dynamic general networks
• Minimax regret 1-sink location problem in dynamic path networks
• Minimax regret vertex 2-sink location problem in dynamic path networks
• Minimax regret 1-sink location problems in dynamic path networks

Cites work

• An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks
• Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity
• Minimax regret 1-sink location problems in dynamic path networks
• Minimax regret k-sink location problem in dynamic path networks
• Minmax regret 1-facility location on uncertain path networks
• Multiple sink location problems in dynamic path networks

Cited in

(6)

• Multiple sink location problem in path networks with a combinational objective
• Minmax regret for sink location on dynamic flow paths with general capacities
• 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
• Minimax regret 1-sink location problem in dynamic path networks

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

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