The multilevel capacitated minimum spanning tree problem

DOI10.1287/IJOC.1040.0123MaRDI QIDQ2892295zbMATH OpenOpenAlexFDO

Authors Ioannis Gamvros, Bruce Golden, S. Raghavan

Publication date 18 June 2012

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.1040.0123

zbMATH Keywords

genetic algorithmsheuristicsmultiexchange neighborhoodnetworks

Mathematics Subject Classification ID

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

Recommendations

• Heuristics for the multi-level capacitated minimum spanning tree problem
• A hybrid VNS algorithm for solving the multi-level capacitated minimum spanning tree problem
• A composite very large-scale neighborhood structure for the 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

Cited in

(15)

• Heuristic procedure neural networks for the CMST problem
• A hybrid VNS algorithm for solving the multi-level capacitated minimum spanning tree problem
• A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
• A multicommodity network flow application for the capacitated minimal spanning tree problem
• The \((K, k)\)-capacitated spanning tree problem
• A multiperiod planning model for the capacitated minimal spanning tree problem
• A personalized walking bus service requiring optimized route decisions: a real case
• GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem
• Heuristics 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
• A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
• A particle swarm optimization approach to the multi level capacitated minimum spanning tree problem
• The (K,k)-Capacitated Spanning Tree Problem
• Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem
• Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem

This page was built for publication: The multilevel capacitated minimum spanning tree problem

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