A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem

DOI10.1016/j.cor.2022.105799OpenAlexW4223551661WikidataQ114193083 ScholiaQ114193083MaRDI QIDQ2147081

Una Benlic, Yongliang Lu, Qinghua Wu

Publication date: 22 June 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2022.105799

zbMATH Keywords

heuristicstabu searchhybrid evolutionary algorithmcapacitated minimum spanning tree

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Uses Software

• SPOT

Cites Work

• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
• Enhanced second order algorithm applied to the capacitated minimum spanning tree problem
• Topological design of telecommunication networks --- local access design methods
• Dynamic programming based heuristics for the topological design of local access networks
• Heuristic search to the capacitated clustering 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.
• The capacitated minimum spanning tree problem: On improved multistar constraints
• Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping
• A hybrid evolutionary search for the generalized quadratic multiple knapsack problem
• RAMP for the capacitated minimum spanning tree problem
• Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
• Savings based ant colony optimization for the capacitated minimum spanning tree problem
• The complexity of the capacitated tree problem
• Topological design of centralized computer networks—formulations and algorithms
• A New Class of Algorithms for Multipoint Network Optimization
• A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
• A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
• The Capacitated Minimum Spanning Tree
• Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem
• Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem

This page was built for publication: A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem