Upper and lower bounding strategies for the generalized minimum spanning tree problem

DOI10.1016/J.EJOR.2004.07.072zbMATH Open1090.90163OpenAlexW2023571729MaRDI QIDQ817552FDOQ817552

Mohamed Haouari, Jouhaina Siala Chaouachi

Publication date: 16 March 2006

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

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

zbMATH Keywords

genetic algorithmSteiner treeLagrangian relaxationgeneralized minimum spanning treerandomized greedy heuristic

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• The Steiner tree problem
• Class Steiner trees and VLSI-design
• Generalized spanning trees
• A comparative analysis of several formulations for the generalized minimum spanning tree problem
• On the generalized minimum spanning tree problem
• An SST-based algorithm for the steiner problem in graphs
• On generalized minimum spanning trees
• A dual ascent approach for steiner tree problems on a directed graph
• Feature Article—Genetic Algorithms for the Operations Researcher
• A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem
• A catalog of steiner tree formulations
• On the History of the Minimum Spanning Tree Problem
• The full Steiner tree problem
• Guided local search and its application to the traveling salesman problem
• Ant-Tree: an ant colony optimization approach to the generalized minimum spanning tree problem
• Solving group Steiner problems as Steiner problems.
• Globally and locally minimal weight spanning tree networks

Cited In (6)

• Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm
• A rapid learning automata-based approach for generalized minimum spanning tree problem
• The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
• A two-level solution approach for solving the 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

This page was built for publication: Upper and lower bounding strategies for the generalized minimum spanning tree problem

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