Enhanced second order algorithm applied to the capacitated minimum spanning tree problem
type: Item
instance of: scholarly article
title: Enhanced second order algorithm applied to the capacitated minimum spanning tree problem
zbMATH Open document ID: 1144.90501
author: Pedro Martins
published in: Computers \& Operations Research
publication date: 2007-02-26T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5129831
zbMATH Keywords: metaheuristics
zbMATH Keywords: repetitive methods
zbMATH Keywords: second order algorithms
zbMATH Keywords: capacitated minimum spanning tree problem
MaRDI profile type: Publication
full work available at URL: j.cor.2005.09.017
OpenAlex ID: W1980076975
cites work: The complexity of the capacitated tree problem
cites work: Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem
cites work: The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
cites work: A New Class of Algorithms for Multipoint Network Optimization
cites work: The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs
cites work: Looking ahead with the pilot method
cites work: A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem
cites work: A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
cites work: Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
cites work: A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
cites work: Savings based ant colony optimization for the capacitated minimum spanning tree problem
cites work: Computational experience with minimum spanning tree algorithms
cites work: Minimum-weight spanning tree algorithms. A survey and empirical study
cites work: Q3056948
cites work: Computing capacitated minimal spanning trees efficiently
cites work: The Capacitated Minimum Spanning Tree
cites work: Q4944737
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
DOI: 10.1016/J.COR.2005.09.017
description: scientific article; zbMATH DE number 5129831