The robust minimum spanning tree problem: compact and convex uncertainty

DOI10.1016/J.ORL.2005.12.007MaRDI QIDQ2643812zbMATH OpenOpenAlexFDO

Authors Martha Salazar-Neumann

Publication date 27 August 2007

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2005.12.007

zbMATH Keywords

minimax regret optimizationrobust spanning treeuncertainty modeling

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Programming involving graphs or networks (90C35)

Recommendations

• On the approximability of robust spanning tree problems
• The robust spanning tree problem with interval data
• A branch and bound algorithm for the robust spanning tree problem with interval data
• The robust fractional spanning tree problem with interval data
• Uncertain distribution-minimum spanning tree problem

Cites work

• Graph theory with applications
• On the complexity of the robust spanning tree problem with interval data
• Robust discrete optimization and its applications
• The robust spanning tree problem with interval data

Cited in

(5)

• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• A polynomial solvable minimum risk spanning tree problem with interval data
• A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty
• On the approximability of robust spanning tree problems
• Target-based distributionally robust minimum spanning tree problem

This page was built for publication: The robust minimum spanning tree problem: compact and convex uncertainty

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