The robust fractional spanning tree problem with interval data

MaRDI QIDQ3605694zbMATH OpenFDO

Authors Stefan Tigan, Eugenia Maria Iacob, I. M. Stancu-Minasian

Publication date 24 February 2009

zbMATH Keywords

absolute robust spanning treefractional optimizationinterval datauncertainty

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• The robust spanning tree problem with interval data
• A branch and bound algorithm for the robust spanning tree problem with interval data
• A polynomial solvable minimum risk spanning tree problem with interval data
• A Benders decomposition approach for the robust spanning tree problem with interval data
• Recoverable robust spanning tree problem under interval uncertainty representations

Cited in

(10)

• A polynomial solvable minimum risk spanning tree problem with interval data
• On the complexity of the robust spanning tree problem with interval data
• The recoverable robust spanning tree problem with interval costs is polynomially solvable
• Recoverable robust spanning tree problem under interval uncertainty representations
• A Benders decomposition approach for the robust spanning tree problem with interval data
• The robust minimum spanning tree problem: compact and convex uncertainty
• The robust spanning tree problem with interval data
• On the enumeration of non-dominated spanning trees with imprecise weights
• A branch and bound algorithm for the robust spanning tree problem with interval data
• Simulated annealing algorithm for the robust spanning tree problem

This page was built for publication: The robust fractional 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 Q3605694)