Enhanced second order algorithm applied to the capacitated minimum spanning tree problem

DOI10.1016/j.cor.2005.09.017zbMath1144.90501OpenAlexW1980076975MaRDI QIDQ869013

Pedro Martins

Publication date: 26 February 2007

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

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

zbMATH Keywords

metaheuristicscapacitated minimum spanning tree problemrepetitive methodssecond order algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (7)

Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem ⋮ A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem ⋮ A biased random-key genetic algorithm for the capacitated minimum spanning tree problem ⋮ Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem ⋮ GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem ⋮ VNS and second order heuristics for the min-degree constrained minimum spanning tree problem ⋮ A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants

Cites Work

• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Looking ahead with the pilot method
• Computational experience with minimum spanning tree algorithms
• The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
• A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
• A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem
• Savings based ant colony optimization for the capacitated minimum spanning tree problem
• The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
• The complexity of the capacitated tree problem
• Computing capacitated minimal spanning trees efficiently
• A New Class of Algorithms for Multipoint Network Optimization
• A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
• The Capacitated Minimum Spanning Tree
• Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem
• Minimum-weight spanning tree algorithms. A survey and empirical study
• Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem

This page was built for publication: Enhanced second order algorithm applied to the capacitated minimum spanning tree problem