Variable neighborhood search for the degree-constrained minimum spanning tree problem

Authors:
Celso C. Ribeiro;Maurício C. Souza
Affiliations:
Department of Computer Science, Catholic University of Rio de Janeiro, Rio de Janeiro, RJ 22453-900, Brazil;Laboratoire d'Informatique, de Modélisation et d'Optimisation de Systémes, Université Blaise Pascal, ISIMA, BP 125, 63173 Aubière Cedex, France
Venue:
Discrete Applied Mathematics - Special issue: Third ALIO-EURO meeting on applied combinatorial optimization
Year:
2002

Citing 5
Cited 17

Foundations of computer science

Foundations of computer science
Variable neighborhood search

Computers and Operations Research
A More Portable Fortran Random Number Generator

ACM Transactions on Mathematical Software (TOMS)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree

Journal of Heuristics

Metaheuristics in combinatorial optimization: Overview and conceptual comparison

ACM Computing Surveys (CSUR)
Variable neighborhood search for the k-cardinality tree

Metaheuristics
Using Lagrangian dual information to generate degree constrained spanning trees

Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date

Computers and Industrial Engineering
VNS and second order heuristics for the min-degree constrained minimum spanning tree problem

Computers and Operations Research
Min-degree constrained minimum spanning tree problem: New formulation via Miller-Tucker-Zemlin constraints

Computers and Operations Research
Using Lagrangian dual information to generate degree constrained spanning trees

Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
A primal branch-and-cut algorithm for the degree-constrained minimum spanning tree problem

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm

Journal of Heuristics
Variable neighborhood search for the orienteering problem

ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
A variable neighbourhood search algorithm for job shop scheduling problems

EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Combining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problems

Computers and Operations Research
An efficient knowledge-based algorithm for the flexible job shop scheduling problem

Knowledge-Based Systems
Hybridization of harmony search with variable neighborhood search for restrictive single-machine earliness/tardiness problem

Information Sciences: an International Journal
Degree constrained minimum spanning tree problem: a learning automata approach

The Journal of Supercomputing
The classroom assignment problem: Complexity, size reduction and heuristics

Applied Soft Computing
The min-degree constrained minimum spanning tree problem: Formulations and Branch-and-cut algorithm

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given an undirected graph with weights associated with its edges, the degree-constrained minimum spanning tree problem consists in finding a minimum spanning tree of the given graph, subject to constraints on node degrees. We propose a variable neighborhood search heuristic for the degree-constrained minimum spanning tree problem, based on a dynamic neighborhood model and using a variable neighborhood descent iterative improvement algorithm for local search. Computational experiments illustrating the effectiveness of the approach on benchmark problems are reported.