A particle swarm optimization approach to the multi level capacitated minimum spanning tree problem

zbMATH Open1192.90030MaRDI QIDQ3565735FDOQ3565735

Authors: Chryssa A. Papagianni, Christos A. Pappas, Nikos Lefkaditis, Iakovos S. Venieris 

Publication date: 7 June 2010

Recommendations

• Particle swarm optimization for communication network design
• A Particle Swarm Optimization Algorithm for the Multicast Routing Problem
• A hybrid VNS algorithm for solving the multi-level capacitated minimum spanning tree problem
• The multilevel capacitated minimum spanning tree problem
• Discrete particle swarm optimization for the minimum labelling Steiner tree problem

zbMATH Keywords

particle swarm optimizationGaussian mutation

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Stochastic network models in operations research (90B15)

Cited In (5)

• Discrete particle swarm optimization for the minimum labelling Steiner tree problem
• Particle swarm optimization for communication network design
• Heuristics for the multi-level capacitated minimum spanning tree problem
• GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem
• Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem

This page was built for publication: A particle swarm optimization approach to the multi level capacitated minimum spanning tree problem

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