A polynomial solvable minimum risk spanning tree problem with interval data

DOI10.1016/J.EJOR.2008.06.039MaRDI QIDQ1027578zbMATH OpenOpenAlexFDO

Authors Jie Hu, Xujin Chen, Xiaodong Hu

Publication date 30 June 2009

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2008.06.039

zbMATH Keywords

combinatorial optimizationinterval dataspanning tree

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• The Minimum Risk Spanning Tree Problem
• The robust spanning tree problem with interval data
• scientific article; zbMATH DE number 5629898
• Minimizing maximum risk for fair network connection with interval data
• The robust fractional spanning tree problem with interval data

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• A Benders decomposition approach for the robust spanning tree problem with interval data
• A branch and bound algorithm for the robust spanning tree problem with interval data
• A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem.
• An approximation algorithm for interval data minmax regret combinatorial optimization problems
• Approximation Schemes for the Restricted Shortest Path Problem
• Computing and minimizing the relative regret in combinatorial optimization with interval data
• Exact arborescences, matchings and cycles
• Interval data minmax regret network optimization problems
• On the Minimum Risk-Sum Path Problem
• On the complexity of the robust spanning tree problem with interval data
• On the hardness of evaluating criticality of activities in a planar network with duration intervals
• Robust discrete optimization and its applications
• The Minimum Risk Spanning Tree Problem
• The constrained minimum spanning tree problem
• The robust minimum spanning tree problem: compact and convex uncertainty
• The robust spanning tree problem with interval data

Cited in

(10)

• The robust spanning tree problem with interval data
• Deterministic risk control for cost-effective network connections
• The Minimum Risk Spanning Tree Problem
• A new model for path planning with interval data
• Risk models for the prize collecting Steiner tree problems with interval data
• Interactive decision making for uncertain minimum spanning tree problems with total importance based on a risk-management approach
• The robust fractional spanning tree problem with interval data
• Risk-control approach for a bottleneck spanning tree problem with the total network reliability under uncertainty
• Min‐sum controllable risk problems with concave risk functions of the same value range
• Min-max controllable risk problems

This page was built for publication: A polynomial solvable minimum risk spanning tree problem with interval data

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