Upper and lower bounding strategies for the generalized minimum spanning tree problem
type: Item
instance of: scholarly article
title: Upper and lower bounding strategies for the generalized minimum spanning tree problem
zbMATH Open document ID: 1090.90163
author: Mohamed Haouari
author: Jouhaina Siala Chaouachi
published in: European Journal of Operational Research
publication date: 2006-03-16T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5012929
zbMATH Keywords: generalized minimum spanning tree
zbMATH Keywords: Steiner tree
zbMATH Keywords: randomized greedy heuristic
zbMATH Keywords: genetic algorithm
zbMATH Keywords: Lagrangian relaxation
MaRDI profile type: Publication
full work available at URL: j.ejor.2004.07.072
OpenAlex ID: W2023571729
cites work: Q4845363
cites work: An SST-based algorithm for the steiner problem in graphs
cites work: Generalized spanning trees
cites work: Solving group Steiner problems as Steiner problems.
cites work: On generalized minimum spanning trees
cites work: A comparative analysis of several formulations for the generalized minimum spanning tree problem
cites work: A catalog of steiner tree formulations
cites work: On the History of the Minimum Spanning Tree Problem
cites work: A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem
cites work: The Steiner tree problem
cites work: Class Steiner trees and VLSI-design
cites work: Globally and locally minimal weight spanning tree networks
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: The full Steiner tree problem
cites work: Q4845371
cites work: On the generalized minimum spanning tree problem
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: Feature Article—Genetic Algorithms for the Operations Researcher
cites work: Ant-Tree: an ant colony optimization approach to the generalized minimum spanning tree problem
cites work: Q3874241
cites work: Guided local search and its application to the traveling salesman problem
cites work: A dual ascent approach for steiner tree problems on a directed graph
DOI: 10.1016/J.EJOR.2004.07.072
description: scientific article; zbMATH DE number 5012929