A hybrid VNS algorithm for solving the multi-level capacitated minimum spanning tree problem

DOI10.1016/j.endm.2018.03.021zbMath1408.90333OpenAlexW2798181791WikidataQ129986796 ScholiaQ129986796MaRDI QIDQ1791944

J. C. T. Campos, Marcone Jamilson Freitas Souza, Alexandre Xavier Martins

Publication date: 11 October 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2018.03.021

zbMATH Keywords

combinatorial optimizationvariable neighborhood searchneighborhood structuresmulti-level capacitated minimum spanning tree

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem

Cites Work

• Topological design of telecommunication networks --- local access design methods
• Variable neighborhood search
• 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
• An Oil Pipeline Design Problem

This page was built for publication: A hybrid VNS algorithm for solving the multi-level capacitated minimum spanning tree problem