Building a capacitated minimum spanning tree using simulated annealing

MaRDI QIDQ447690zbMATH OpenFDO

Authors Aleksandr Vladimirovich Ipatov

Publication date 5 September 2012

Published in The Bulletin of Irkutsk State University. Series Mathematics (Search for Journal in Brave)

zbMATH Keywords

simulated annealingmetaheuristicneighborhoodcapacitated minimum spanning tree

Mathematics Subject Classification ID

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

Recommendations

• Solving the generalized minimum spanning tree problem with simulated annealing
• scientific article; zbMATH DE number 2090612
• A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
• Heuristics for the multi-level capacitated minimum spanning tree problem
• A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem

Cited in

(4)

• A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem
• Enhanced second order algorithm applied to the capacitated minimum spanning tree problem
• RAMP for the capacitated minimum spanning tree problem
• scientific article; zbMATH DE number 2090612 (Why is no real title available?)

This page was built for publication: Building a capacitated minimum spanning tree using simulated annealing

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