Solving the 2-rooted mini-max spanning forest problem by branch-and-bound

DOI10.1016/j.ejor.2009.07.038zbMath1176.90507OpenAlexW2099673191MaRDI QIDQ1043334

M. Mekking, A. Volgenant

Publication date: 7 December 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.07.038

zbMATH Keywords

combinatorial optimizationbranch-and-boundbottleneck criterionspanning forest

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Optimality cuts and a branch-and-cut algorithm for the \(k\)-rooted mini-max spanning forest problem

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• A linear algorithm for bipartition of biconnected graphs
• On the complexity of partitioning graphs into connected subgraphs
• The Min-Max Spanning Tree Problem and some extensions
• A heuristic algorithm for the mini-max spanning forest problem
• A branch-and-bound algorithm for the mini-max spanning forest problem
• On the complexity of graph tree partition problems.
• The number of nets of the regular convex polytopes in dimension \(\leq 4\)
• A tabu search heuristic for the Steiner Tree Problem
• Depth-First Search and Linear Graph Algorithms