scientific article; zbMATH DE number 1054929

zbMATH Open0877.90075MaRDI QIDQ4350039FDOQ4350039

Geoff Craig, Marimuthu Palaniswami, Mohan Krishnamoorthy

Publication date: 28 August 1997

Title of this publication is not available (Why is that?)

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

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)

Cited In (16)

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

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)