The Multilevel Capacitated Minimum Spanning Tree Problem

DOI10.1287/ijoc.1040.0123zbMath1241.90160OpenAlexW1978577509MaRDI QIDQ2892295

Ioannis Gamvros, Bruce L. Golden, S. Raghu 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

heuristicsnetworksgenetic algorithmsmultiexchange neighborhood

Mathematics Subject Classification ID

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

Related Items

Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem ⋮ The \((K, k)\)-capacitated spanning tree problem ⋮ 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 ⋮ A personalized walking bus service requiring optimized route decisions: a real case ⋮ A hybrid VNS algorithm for solving the multi-level capacitated minimum spanning tree problem