Simulated annealing algorithm for the robust spanning tree problem

DOI10.1007/s10732-007-9057-8zbMath1152.90012OpenAlexW2068855072MaRDI QIDQ945053

B. E. Eshmatov

Publication date: 10 September 2008

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10419/147649

zbMATH Keywords

Simulated annealingUncertaintyRobust spanning tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty ⋮ Algorithms for the minmax regret path problem with interval data ⋮ Heuristics for the central tree problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• On the shortest spanning subtree of a graph and the traveling salesman problem
• A branch and bound algorithm for the robust spanning tree problem with interval data
• An approximation algorithm for interval data minmax regret combinatorial optimization problems
• Robust solutions of uncertain linear programs
• Robust discrete optimization and its applications
• On the complexity of the robust spanning tree problem with interval data
• Robust solutions of linear programming problems contaminated with uncertain data
• A Benders decomposition approach for the robust spanning tree problem with interval data
• Automata, Languages and Programming
• The robust spanning tree problem with interval data

This page was built for publication: Simulated annealing algorithm for the robust spanning tree problem