scientific article; zbMATH DE number 731844

MaRDI QIDQ4325280zbMATH OpenFDO

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

Publication date 8 March 1995

zbMATH Keywords

branch-and-boundminimum weight spanning treenon-negative edge weightssimple undirected graph

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 91018
• Minimum Diameter Spanning Trees and Related Problems
• scientific article; zbMATH DE number 1594512
• scientific article; zbMATH DE number 1947056
• Diameter-constrained Steiner tree

Cited in

(24)

• Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations
• The non-approximability of bicriteria network design problems
• Finding bounded diameter minimum spanning tree in general graphs
• A hybrid heuristic for the diameter constrained minimum spanning tree problem
• The two-level diameter constrained spanning tree problem
• Mathematical programming models for some smallest-world problems
• scientific article; zbMATH DE number 1594512 (Why is no real title available?)
• Hop constrained Steiner trees with multiple root nodes
• Solving diameter-constrained minimum spanning tree problems by constraint programming
• Vertex fusion under diameter constraints
• Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem
• Minimum Diameter Spanning Trees and Related Problems
• scientific article; zbMATH DE number 91018 (Why is no real title available?)
• New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints
• scientific article; zbMATH DE number 1285634 (Why is no real title available?)
• scientific article; zbMATH DE number 1947056 (Why is no real title available?)
• A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications
• An exact method for solving the bi-objective minimum diameter-cost spanning tree problem
• Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
• Approximating the degree-bounded minimum diameter spanning tree problem
• Revisiting search methods for the bounded-diameter minimum spanning tree problem
• New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints
• Greedy heuristics for the diameter-constrained minimum spanning tree problem
• An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees

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 Q4325280)