Publication:4350039
From MaRDI portal
zbMath0877.90075MaRDI QIDQ4350039
Mohan Krishnamoorthy, Marimuthu Palaniswami, Geoff Craig
Publication date: 28 August 1997
heuristics; neural networks; simulated annealing; degree constrained minimum spanning tree; greedy random algorithms
90C35: Programming involving graphs or networks
68T05: Learning and adaptive systems in artificial intelligence
Related Items
A hop constrained min-sum arborescence with outage costs, Variable neighborhood search for the degree-constrained minimum spanning tree problem, Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs., A multiperiod degree constrained minimal spanning tree problem, Metaheuristics: A bibliography, Using Lagrangian dual information to generate degree constrained spanning trees, Lower and upper bounds for the degree-constrained minimum spanning tree problem