Minimax regret 1-sink location problem in dynamic cycle networks
From MaRDI portal
Publication:477612
DOI10.1016/J.IPL.2014.09.006zbMATH Open1302.90105OpenAlexW1990351612MaRDI QIDQ477612FDOQ477612
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
Recommendations
Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Cites Work
- 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
- Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity
- Multiple sink location problems in dynamic path networks
- An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree 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)
