scientific article; zbMATH DE number 1054929
From MaRDI portal
Publication:4350039
zbMath0877.90075MaRDI QIDQ4350039
Geoff Craig, Marimuthu Palaniswami, Mohan Krishnamoorthy
Publication date: 28 August 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
heuristicsneural networkssimulated annealingdegree constrained minimum spanning treegreedy random algorithms
Programming involving graphs or networks (90C35) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (10)
Variable neighborhood search for the degree-constrained minimum spanning tree problem ⋮ A hop constrained min-sum arborescence with outage costs ⋮ Metaheuristics: A bibliography ⋮ Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs. ⋮ Using Lagrangian dual information to generate degree constrained spanning trees ⋮ Lower and upper bounds for the degree-constrained minimum spanning tree problem ⋮ Exact solution approaches for the multi-period degree constrained minimum spanning tree problem ⋮ Design of capacitated degree constrained min-sum arborescence ⋮ A multiperiod degree constrained minimal spanning tree problem ⋮ Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
This page was built for publication:
