Multiple sink location problem in path networks with a combinational objective
From MaRDI portal
Publication:828700
DOI10.1007/s11590-020-01597-wzbMath1466.90089OpenAlexW3027926242MaRDI QIDQ828700
Weitian Tong, Shaofeng Ru, Taibo Luo, Yin-Feng Xu, Hong-Mei Li
Publication date: 5 May 2021
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-020-01597-w
Cites Work
- Minmax regret 1-facility location on uncertain path networks
- Minimax regret 1-sink location problem with accessibility in dynamic general networks
- Minimax regret 1-sink location problem in dynamic cycle networks
- Minimax regret 1-median problem in dynamic path networks
- An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks
- Improved algorithms for computing minmax regret sinks on dynamic path and tree networks
- Multiple sink location problems in dynamic path networks
- Minsum \(k\)-sink problem on path networks
- Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities
- Minmax-regret evacuation planning for cycle networks
- Minimax regret 1-sink location problem in dynamic path networks
- Improved algorithms for computing \(k\)-sink on dynamic flow path networks
- Medi-centre Location Problems
- Finite Dominating Sets for Network Location Problems
- Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
- 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
- Constructing Maximal Dynamic Flows from Static Flows
- The Location of Emergency Service Facilities
- Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity
- Minimax regret vertex 2-sink location problem in dynamic path networks
