Minimizing maximum risk for fair network connection with interval data

DOI10.1007/S10255-008-8812-4MaRDI QIDQ2267272zbMATH OpenOpenAlexFDO

Authors 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 pathinterval dataspanning treeminimax approachnetwork 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)

Recommendations

• Deterministic risk control for cost-effective network connections
• Network stability under max-min fair bandwidth sharing
• Interval data minmax regret network optimization problems
• An approximation to max min fairness in multi commodity networks
• scientific article; zbMATH DE number 1717248
• End-to-end maxmin fairness in multihop wireless networks: theory and protocol
• Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks
• Interval routing in reliability networks
• Successive quadratic upper-bounding for discrete mean-risk minimization and network interdiction

Cites work

• scientific article; zbMATH DE number 3677874 (Why is no real title available?)
• A branch and bound algorithm for the robust shortest path problem with interval data.
• A note on two problems in connexion with graphs
• Combinatorial Optimization with Rational Objective Functions
• Computing and minimizing the relative regret in combinatorial optimization with interval data
• Minimax and applications
• On the Minimum Risk-Sum Path Problem
• On the online shortest path problem with limited arc cost dependencies
• On the robust shortest path problem.
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Robust discrete optimization and its applications
• The Minimum Risk Spanning Tree Problem

Cited in

(5)

• Deterministic risk control for cost-effective network connections
• A new model for path planning with interval data
• Risk models for the prize collecting Steiner tree problems with interval data
• A polynomial solvable minimum risk spanning tree problem with interval data
• Min-max controllable risk problems

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

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