scientific article; zbMATH DE number 731844

zbMath0819.90114MaRDI QIDQ4325280

Peter Caccetta, N. R. Achuthan, Louis Caccetta, James F. Geelen

Publication date: 8 March 1995

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

branch-and-boundminimum weight spanning treesimple undirected graphnon-negative edge weights

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (14)

Hop constrained Steiner trees with multiple root nodes ⋮ Greedy heuristics for the diameter-constrained minimum spanning tree problem ⋮ Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations ⋮ An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees ⋮ Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem ⋮ New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints ⋮ Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs ⋮ Solving diameter-constrained minimum spanning tree problems by constraint programming ⋮ A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications ⋮ New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints ⋮ A hybrid heuristic for the diameter constrained minimum spanning tree problem ⋮ The non-approximability of bicriteria network design problems ⋮ An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem ⋮ The two-level diameter constrained spanning tree problem

This page was built for publication: