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

DOI10.1057/PALGRAVE.JORS.2601821zbMath1104.90055OpenAlexW2088814889MaRDI QIDQ4679783

Moshe Dror, Mohamed Haouari, Jouhaina Siala Chaouachi

Publication date: 21 June 2005

Published in: 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

Lagrangian relaxationbranch-and-boundminimum spanning tree

Mathematics Subject Classification ID

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

Related Items (7)

A two-level metaheuristic for the all colors shortest path problem ⋮ A two-level solution approach for solving the generalized minimum spanning tree problem ⋮ A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem ⋮ The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches ⋮ A tabu search heuristic for the generalized minimum spanning tree problem ⋮ The prize-collecting generalized minimum spanning tree problem ⋮ The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances

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