Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm

DOI10.1057/PALGRAVE.JORS.2601821MaRDI QIDQ4679783zbMATH OpenOpenAlexFDO

Authors Mohamed Haouari, Jouhaina Siala Chaouachi, Moshe Dror

Publication date 21 June 2005

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2601821

zbMATH Keywords

minimum spanning treebranch-and-boundLagrangian relaxation

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Recommendations

• The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
• A generalization of the minimum branch vertices spanning tree problem
• On the generalized minimum spanning tree problem
• A branch and bound algorithm for the capacitated minimum spanning tree problem
• scientific article; zbMATH DE number 2090612
• Improving on branch-and-cut algorithms for generalized minimum spanning trees
• Upper and lower bounding strategies for the generalized minimum spanning tree problem
• A two-level solution approach for solving the generalized minimum spanning tree problem
• An approximation algorithm for the least version of the generalized minimum spanning tree problem
• The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances

Cited in

(18)

• The prize-collecting generalized minimum spanning tree problem
• scientific article; zbMATH DE number 5036665 (Why is no real title available?)
• A tabu search heuristic for the generalized minimum spanning tree problem
• A branch and bound algorithm for the capacitated minimum spanning tree problem
• The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
• A two-level metaheuristic for the all colors shortest path problem
• Upper and lower bounding strategies for the generalized minimum spanning tree problem
• A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
• scientific article; zbMATH DE number 5621997 (Why is no real title available?)
• Solving the 2-rooted mini-max spanning forest problem by branch-and-bound
• A two-level solution approach for solving the generalized minimum spanning tree problem
• On symbolic OBDD-based algorithms for the minimum spanning tree problem
• The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
• The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
• scientific article; zbMATH DE number 2201897 (Why is no real title available?)
• The generalized minimum spanning tree: polyhedra and branch-and-cut
• scientific article; zbMATH DE number 5876375 (Why is no real title available?)
• A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem

This page was built for publication: Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm

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