A heuristic algorithm for the mini-max spanning forest problem

DOI10.1016/0377-2217(94)00335-1MaRDI QIDQ1278250zbMATH OpenOpenAlexFDO

Authors Takeo Yamada, Hideo Takahashi, Seiji Kataoka

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)

Recommendations

• A branch-and-bound algorithm for the mini-max spanning forest problem
• A class of heuristics for the constrained forest problem
• Another greedy heuristic for the constrained forest problem
• Solving the 2-rooted mini-max spanning forest problem by branch-and-bound
• scientific article; zbMATH DE number 1779876

Cites work

• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• Network flows. Theory, algorithms, and applications.
• On the History of the Minimum Spanning Tree Problem
• On the shortest spanning subtree of a graph and the traveling salesman problem
• `` Strong NP-Completeness Results

Cited in

(23)

• A mini–max spanning forest approach to the political districting problem
• scientific article; zbMATH DE number 5036665 (Why is no real title available?)
• Performance Oriented Spanning Trees
• Two heuristics for the rainbow spanning forest problem
• Political districting: from classical models to recent approaches
• A branch-and-bound algorithm for the mini-max spanning forest problem
• Political districting: From classical models to recent approaches
• A greedy heuristic for a minimum-weight forest problem
• Stochastic maximum weight forest problem
• On the complexity of graph tree partition problems.
• scientific article; zbMATH DE number 1779876 (Why is no real title available?)
• Formulations and branch-and-cut algorithm for the \(K\)-rooted mini-max spanning forest problem
• Combinatorial approximation algorithms for the maximum bounded connected bipartition problem
• Solving the 2-rooted mini-max spanning forest problem by branch-and-bound
• A class of heuristics for the constrained forest problem
• Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector
• Optimality cuts and a branch-and-cut algorithm for the \(k\)-rooted mini-max spanning forest problem
• Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem
• Heuristics for the central tree problem
• scientific article; zbMATH DE number 4010557 (Why is no real title available?)
• Approximating minimum \(k\)-tree cover of a connected graph inspired by the multi-ferry routing in delay tolerant networks
• Another greedy heuristic for the constrained forest problem
• Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm

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

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