A heuristic algorithm for the mini-max spanning forest problem

DOI10.1016/0377-2217(94)00335-1zbMath0918.90135OpenAlexW1973984239MaRDI QIDQ1278250

Seiji Kataoka, Takeo Yamada, Hideo Takahashi

Publication date: 27 April 1999

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

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00335-1

zbMATH Keywords

heuristicsgraph theoryspanning forestmini-max problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (11)

Optimality cuts and a branch-and-cut algorithm for the \(k\)-rooted mini-max spanning forest problem ⋮ A mini–max spanning forest approach to the political districting problem ⋮ Political districting: from classical models to recent approaches ⋮ On the complexity of graph tree partition problems. ⋮ Political districting: From classical models to recent approaches ⋮ Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm ⋮ Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector ⋮ A branch-and-bound algorithm for the mini-max spanning forest problem ⋮ Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem ⋮ Solving the 2-rooted mini-max spanning forest problem by branch-and-bound ⋮ Combinatorial approximation algorithms for the maximum bounded connected bipartition problem

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• `` Strong NP-Completeness Results
• On the History of the Minimum Spanning Tree Problem
• Unnamed Item
• Unnamed Item

This page was built for publication: A heuristic algorithm for the mini-max spanning forest problem