Deterministic risk control for cost-effective network connections

DOI10.1016/j.tcs.2009.08.019zbMath1207.90025OpenAlexW2053772954MaRDI QIDQ621844

Jie Hu, Alfredo Candia-Véjar, Eduardo Álvarez-Miranda, Xiao-Dong Hu, Xu-jin Chen

Publication date: 28 January 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.08.019

zbMATH Keywords

network designinterval datapolynomial time algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Reliability, availability, maintenance, inspection in operations research (90B25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Min‐sum controllable risk problems with concave risk functions of the same value range ⋮ Min-max controllable risk problems

Cites Work

• The computational complexity of the relative robust shortest path problem with interval data
• A new model for path planning with interval data
• Computing and minimizing the relative regret in combinatorial optimization with interval data
• A polynomial solvable minimum risk spanning tree problem with interval data
• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• A branch and bound algorithm for the robust shortest path problem with interval data.
• On the complexity of the robust spanning tree problem with interval data
• Interval data minmax regret network optimization problems
• An exact algorithm for the robust shortest path problem with interval data