scientific article; zbMATH DE number 1054929

MaRDI QIDQ4350039zbMATH OpenFDO

Authors Geoff Craig, Mohan Krishnamoorthy, Marimuthu Palaniswami

Publication date 28 August 1997

zbMATH Keywords

simulated annealingheuristicsneural networksdegree constrained minimum spanning treegreedy random algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Programming involving graphs or networks (90C35)

Recommendations

• Comparison of algorithms for the degree constrained minimum spanning tree
• Variable neighborhood search for the degree-constrained minimum spanning tree problem
• Edge exchanges in the degree-constrained minimum spanning tree problem
• A branch and cut method for the degree-constrained minimum spanning tree problem
• A note on genetic algorithms for degree-constrained spanning tree problems

Cited in

(20)

• The cellular competitive decision algorithm for the degree-constrained minimum spanning tree problem
• Comparison of algorithms for the degree constrained minimum spanning tree
• A hop constrained min-sum arborescence with outage costs
• Approximation of the degree-constrained minimum spanning hierarchies
• Lower and upper bounds for the degree-constrained minimum spanning tree problem
• Variable neighborhood search for the degree-constrained minimum spanning tree problem
• Design of capacitated degree constrained min-sum arborescence
• A multiperiod degree constrained minimal spanning tree problem
• Metaheuristics: A bibliography
• An average case analysis of the minimum spanning tree heuristic for the power assignment problem
• Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs.
• Research on the degree-constrained minimum spanning tree problem based on the Prim algorithm
• Exact solution approaches for the multi-period degree constrained minimum spanning tree problem
• Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem
• Using Lagrangian dual information to generate degree constrained spanning trees
• Competitive decision algorithm for the degree-constrained minimum spanning tree
• Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
• Novel degree constrained minimum spanning tree algorithm based on an improved multicolony ant algorithm
• VNS and second order heuristics for the min-degree constrained minimum spanning tree problem
• Another greedy heuristic for the constrained forest problem

This page was built for publication:

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