Simulated annealing algorithm for the robust spanning tree problem

DOI10.1007/S10732-007-9057-8MaRDI QIDQ945053zbMATH OpenOpenAlexFDO

Authors 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

UncertaintySimulated annealingRobust spanning tree

Mathematics Subject Classification ID

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

Recommendations

• A branch and bound algorithm for the robust spanning tree problem with interval data
• The robust spanning tree problem with interval data
• A Benders decomposition approach for the robust spanning tree problem with interval data
• On the approximability of robust spanning tree problems
• The robust fractional spanning tree problem with interval data

Cites work

• scientific article; zbMATH DE number 4048925 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 804636 (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
• An approximation algorithm for interval data minmax regret combinatorial optimization problems
• Automata, Languages and Programming
• On the complexity of the robust spanning tree problem with interval data
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Optimization by simulated annealing
• Robust discrete optimization and its applications
• Robust solutions of linear programming problems contaminated with uncertain data
• Robust solutions of uncertain linear programs
• The robust spanning tree problem with interval data

Cited in

(5)

• Algorithms for the minmax regret path problem with interval data
• Heuristics for the central tree problem
• A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty
• A branch and bound algorithm for the robust spanning tree problem with interval data
• A Benders decomposition approach for the robust spanning tree problem with interval data

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

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