Multiple sink location problem in path networks with a combinational objective

DOI10.1007/S11590-020-01597-WzbMATH Open1466.90089OpenAlexW3027926242MaRDI QIDQ828700FDOQ828700

Authors: Taibo Luo, Shaofeng Ru, Weitian Tong, Hongmei Li, Yinfeng Xu 

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

Recommendations

• Multiple sink location problems in dynamic path networks
• Multiple sink location problems in dynamic path networks
• Minsum \(k\)-sink problem on path networks
• Minimax regret vertex 2-sink location problem in dynamic path networks
• Minimax regret 1-sink location problem in dynamic path networks

zbMATH Keywords

polynomial time algorithmsink locationcombinational objectivepath network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• The Location of Emergency Service Facilities
• 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
• Constructing maximal dynamic flows from static flows
• Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity
• Minimax regret 1-sink location problem in dynamic path networks
• Minimax regret 1-sink location problem with accessibility in dynamic general networks
• Minimax regret 1-sink location problem in dynamic cycle networks
• 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
• Improved algorithms for computing minmax regret sinks on dynamic path and tree networks
• Finite Dominating Sets for Network Location Problems
• Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
• Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities
• Minimax regret vertex 2-sink location problem in dynamic path networks
• Multiple sink location problems in dynamic path networks
• Medi-centre Location Problems
• Minsum \(k\)-sink problem on path networks
• Minmax-regret evacuation planning for cycle networks
• Improved algorithms for computing \(k\)-sink on dynamic flow path networks

This page was built for publication: Multiple sink location problem in path networks with a combinational objective

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