The robust minimum spanning tree problem: compact and convex uncertainty

DOI10.1016/j.orl.2005.12.007zbMath1278.90418OpenAlexW1972643866MaRDI QIDQ2643812

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

robust spanning treeuncertainty modelingminimax regret optimization

Mathematics Subject Classification ID

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

Related Items (3)

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

Cites Work

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

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