Deterministic risk control for cost-effective network connections

Authors:
Eduardo Álvarez-Miranda;Xujin Chen;Jie Hu;Xiaodong Hu;Alfredo Candia-Véjar
Affiliations:
Industrial Management Department, Universidad de Talca, Chile;Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing 100190, PR China;State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, Beijing 100044, PR China;Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing 100190, PR China;Industrial Management Department, Universidad de Talca, Chile
Venue:
Theoretical Computer Science
Year:
2011

Citing 6
Cited 0

Interval data minmax regret network optimization problems

Discrete Applied Mathematics
An exact algorithm for the robust shortest path problem with interval data

Computers and Operations Research
A new model for path planning with interval data

Computers and Operations Research
Computing and minimizing the relative regret in combinatorial optimization with interval data

Discrete Optimization
On the complexity of the robust spanning tree problem with interval data

Operations Research Letters
A branch and bound algorithm for the robust shortest path problem with interval data

Operations Research Letters

Quantified Score

Hi-index	5.23

Visualization

Abstract

This paper considers the minimum connection problem in networks with uncertain data. In such a network it is assumed that one can establish a link e by paying a cost c"e in a given interval [c"e^-,c"e^+] while taking a risk (c"e^+-c"e)/(c"e^+-c"e^-) of link failure. We develop polynomial time algorithms for minimum cost network connection with paths or spanning trees under risk-sum constraints.