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

DOI10.1016/J.COR.2005.09.017MaRDI QIDQ869013zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A simple enhancement of the Esau–Williams heuristic for the capacitated minimum spanning tree problem
• Building a capacitated minimum spanning tree using simulated annealing
• A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
• Parametric enhancements of the Esau–Williams heuristic for the capacitated minimum spanning tree problem
• The capacitated minimum spanning tree problem: revisiting hop-indexed formulations

Cites work

• scientific article; zbMATH DE number 1420487 (Why is no real title available?)
• A New Class of Algorithms for Multipoint Network Optimization
• 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
• A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
• Computational experience with minimum spanning tree algorithms
• Computing capacitated minimal spanning trees efficiently
• Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem
• Looking ahead with the pilot method
• Minimum-weight spanning tree algorithms. A survey and empirical study
• Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
• Network flows. Theory, algorithms, and applications.
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Savings based ant colony optimization for the capacitated minimum spanning tree problem
• The Capacitated Minimum Spanning Tree
• The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
• The complexity of the capacitated tree problem
• The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs

Cited in

(7)

• A hybrid evolutionary algorithm 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
• A branch-and-price-and-cut algorithm for the cable-routing problem in solar power plants
• Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem
• A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
• VNS and second order heuristics for the min-degree constrained minimum spanning tree problem

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

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