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

DOI10.1007/S10878-014-9716-2zbMATH Open1360.90289OpenAlexW1967283740MaRDI QIDQ5963611FDOQ5963611

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

Recommendations

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

zbMATH Keywords

algorithmminimax regretsink locationpath network

Mathematics Subject Classification ID

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

Cites Work

• Robust discrete optimization and its applications
• Minmax Regret 1-Facility Location on Uncertain Path Networks
• Minimax Regret 1-Sink Location Problems in Dynamic Path Networks
• Constructing Maximal Dynamic Flows from Static Flows
• Minimax regret 1-sink location problem in dynamic path networks
• An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks
• Models of wayfinding in emergency evacuations

Cited In (11)

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