Variable neighborhood search for the degree-constrained minimum spanning tree problem
type: Item
instance of: scholarly article
title: Variable neighborhood search for the degree-constrained minimum spanning tree problem
zbMATH Open document ID: 0994.90123
DOI: 10.1016/S0166-218X(01)00255-4
author: Celso C. Ribeiro
author: Maurício C. Souza
published in: Discrete Applied Mathematics
publication date: 2002-05-15T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1741964
zbMATH Keywords: degree-constrained
zbMATH Keywords: minimum spanning tree
zbMATH Keywords: metaheuristics
MaRDI profile type: Publication
cites work: Q4023826
cites work: Enhancements Of Spanning Tree Labelling Procedures For Network Optimization
cites work: Q4350039
cites work: Greedy randomized adaptive search procedures
cites work: Q4198056
cites work: Topological design of centralized computer networks—formulations and algorithms
cites work: Recent Developments in Computer Implementation Technology for Network Flow Algorithms
cites work: An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem
cites work: Q4495203
cites work: Comparison of algorithms for the degree constrained minimum spanning tree
cites work: Variable neighborhood search
cites work: Edge exchanges in the degree-constrained minimum spanning tree problem
cites work: A More Portable Fortran Random Number Generator
cites work: A Lagrangean approach to the degree-constrained minimum spanning tree problem
cites work: A note on genetic algorithms for degree-constrained spanning tree problems
full work available at URL: s0166-218x(01)00255-4
OpenAlex ID: W2063193808
description: scientific article; zbMATH DE number 1741964