A generalization of the minimum branch vertices spanning tree problem

DOI10.1007/978-3-319-96151-4_29MaRDI QIDQ1661907zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

\(k\)-MBVSTinteger linear programming (ILP)MBVSTminimization of branch verticesoptical networksspanning tree

Mathematics Subject Classification ID

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

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

Cited in

(20)

• Solving the 2-rooted mini-max spanning forest problem by branch-and-bound
• A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
• Upgrading min-max spanning tree problem under various cost functions
• An exact and heuristic approach for the d-minimum branch vertices problem
• The generalized minimum branch vertices problem: properties and polyhedral analysis
• Scatter search for the minimum leaf spanning tree problem
• Minimizing branching vertices in distance-preserving subgraphs
• An axiomatic approach in minimum cost spanning tree problems with groups
• Cutting-plane-based algorithms for two branch vertices related spanning tree problems
• An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
• On recursive computation of minimum spanning trees for special partial graphs
• scientific article; zbMATH DE number 3974972 (Why is no real title available?)
• scientific article; zbMATH DE number 2037815 (Why is no real title available?)
• Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm
• scientific article; zbMATH DE number 2086635 (Why is no real title available?)
• scientific article; zbMATH DE number 5876375 (Why is no real title available?)
• A genetic approach for the 2‐edge‐connected minimum branch vertices problem
• An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth
• Bounded-degree spanning tree problems: models and new algorithms
• Additivity in minimum cost spanning tree problems

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)