Minimax regret vertex 2-sink location problem in dynamic path networks

DOI10.1007/S10878-014-9716-2MaRDI QIDQ5963611zbMATHOpenAlexFDO

Authors Hongmei Li, Yinfeng Xu, Guanqun Ni

Publication date 23 February 2016

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

Full work available at URL https://doi.org/10.1007/s10878-014-9716-2

zbMATH Keywords

algorithmminimax regretsink locationpath network

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Continuous location (90B85)

Recommendations

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

Cites work

• An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks
• Constructing maximal dynamic flows from static flows
• Minimax regret 1-sink location problem in dynamic path networks
• Minimax regret 1-sink location problems in dynamic path networks
• Minmax regret 1-facility location on uncertain path networks
• Models of wayfinding in emergency evacuations
• Robust discrete optimization and its applications

Cited in

(15)

• Minimax regret 1-sink location problem in dynamic path networks
• Minimax regret 1-sink location problems in dynamic path networks
• Pre-treatment of path problems with required lengths
• Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network
• Multiple sink location problem in path networks with a combinational objective
• Minimax regret k-sink location problem in dynamic path networks
• Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights
• Minmax regret for sink location on dynamic flow paths with general capacities
• Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity
• Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights
• 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
• Minimax regret sink location problem in dynamic tree networks with uniform capacity
• Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities
• Minimax regret 1-sink location problem in dynamic cycle networks

This page was built for publication: Minimax regret vertex 2-sink location problem in dynamic path networks

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