A generalization of the minimum branch vertices spanning tree problem

DOI10.1007/978-3-319-96151-4_29zbMATH Open1403.90582OpenAlexW2612502174MaRDI QIDQ1661907FDOQ1661907

Authors: Massinissa Merabet, Jitamitra Desai, Miklos Molnar 

Publication date: 17 August 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-96151-4_29

Recommendations

• scientific article; zbMATH DE number 2086635
• A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
• Bounded-degree spanning tree problems: models and new algorithms
• Cutting-plane-based algorithms for two branch vertices related spanning tree problems
• An exact and heuristic approach for the \(d\)-minimum branch vertices problem

zbMATH Keywords

spanning treeoptical networks\(k\)-MBVSTinteger linear programming (ILP)MBVSTminimization of branch vertices

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cited In (18)

• Minimizing branching vertices in distance-preserving subgraphs
• Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm
• Additivity in minimum cost spanning tree problems
• An exact and heuristic approach for the \(d\)-minimum branch vertices problem
• Title not available (Why is that?)
• The generalized minimum branch vertices problem: properties and polyhedral analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• On recursive computation of minimum spanning trees for special partial graphs
• Scatter search for the minimum leaf spanning tree problem
• Bounded-degree spanning tree problems: models and new algorithms
• Upgrading min-max spanning tree problem under various cost functions
• Solving the 2-rooted mini-max spanning forest problem by branch-and-bound
• An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth
• Title not available (Why is that?)
• A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
• An axiomatic approach in minimum cost spanning tree problems with groups
• An edge-swap heuristic for generating spanning trees with minimum number of branch vertices

This page was built for publication: A generalization of the minimum branch vertices spanning tree problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1661907)