Heuristics for the multi-level capacitated minimum spanning tree problem

DOI10.1007/s11590-013-0607-8zbMath1294.90019OpenAlexW2094923491MaRDI QIDQ2448129

Christos A. Pappas, Chrysa A. Papagianni, Angelos-Christos G. Anadiotis, Iakovos S. Venieris

Publication date: 30 April 2014

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-013-0607-8

zbMATH Keywords

heuristicsnetwork designmulti-level capacitated minimum spanning tree problem

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• The Multilevel Capacitated Minimum Spanning Tree Problem
• Topological design of centralized computer networks—formulations and algorithms
• The complexity of the capacitated tree problem
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
• A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
• Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem

This page was built for publication: Heuristics for the multi-level capacitated minimum spanning tree problem