Minimizing maximum risk for fair network connection with interval data

DOI10.1007/s10255-008-8812-4zbMath1181.90049OpenAlexW2109863007MaRDI QIDQ2267272

Jie Hu

Publication date: 1 March 2010

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-008-8812-4

zbMATH Keywords

shortest pathspanning treeminimax approachinterval datanetwork connection

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Optimality conditions for minimax problems (49K35)

Related Items (2)

Risk models for the prize collecting Steiner tree problems with interval data ⋮ Min-max controllable risk problems

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Computing and minimizing the relative regret in combinatorial optimization with interval data
• Robust discrete optimization and its applications
• On the robust shortest path problem.
• A branch and bound algorithm for the robust shortest path problem with interval data.
• Minimax and applications
• On the Minimum Risk-Sum Path Problem
• The Minimum Risk Spanning Tree Problem
• Combinatorial Optimization with Rational Objective Functions
• On the online shortest path problem with limited arc cost dependencies

This page was built for publication: Minimizing maximum risk for fair network connection with interval data