Comparison of algorithms for the degree constrained minimum spanning tree

DOI10.1023/A:1011977126230MaRDI QIDQ5960737zbMATH OpenOpenAlexFDO

Authors Mohan Krishnamoorthy, Andreas T. Ernst, Y. M. Sharaiha

Publication date 2001

Published in Journal of Heuristics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1011977126230

zbMATH Keywords

degree constrainted minimum spanning treeheuristicstree representation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 1054929
• New genetic algorithm approach for the MIN-degree constrained minimum spanning tree
• A note on genetic algorithms for degree-constrained spanning tree problems
• Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
• Variable neighborhood search for the degree-constrained minimum spanning tree problem

Cited in

(26)

• VNS and second order heuristics for the min-degree constrained minimum spanning tree problem
• Variable neighborhood search for the degree-constrained minimum spanning tree problem
• ILP formulation of the degree-constrained minimum spanning hierarchy problem
• Novel degree constrained minimum spanning tree algorithm based on an improved multicolony ant algorithm
• A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem
• New genetic algorithm approach for the MIN-degree constrained minimum spanning tree
• A unifying model for locally constrained spanning tree problems
• The generalized dependency constrained spanning tree problem
• Degree-constrained \(k\)-minimum spanning tree problem
• A computational study on the maximum-weight bounded-degree rooted tree problem
• Remarks on the application of genetic algorithm and tabu search method to nonlinear spanning tree problems
• Using Lagrangian dual information to generate degree constrained spanning trees
• Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
• The salesman and the tree: the importance of search in CP
• DEGREE-CONSTRAINED MINIMUM SPANNING TREE PROBLEM IN STOCHASTIC GRAPH
• Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
• The cellular competitive decision algorithm for the degree-constrained minimum spanning tree problem
• An optimization algorithm for solving degree-constrained minimum spanning tree problems
• Competitive decision algorithm for the degree-constrained minimum spanning tree
• NEW METAHEURISTIC APPROACHES FOR THE LEAF-CONSTRAINED MINIMUM SPANNING TREE PROBLEM
• scientific article; zbMATH DE number 1054929 (Why is no real title available?)
• A note on genetic algorithms for degree-constrained spanning tree problems
• LS(graph): a constraint-based local search for constraint optimization on trees and paths
• Connecting the world efficiently
• Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
• Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem

This page was built for publication: Comparison of algorithms for the degree constrained minimum spanning tree

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