A tabu search heuristic for the generalized minimum spanning tree problem
type: Item
instance of: scholarly article
title: A tabu search heuristic for the generalized minimum spanning tree problem
zbMATH Open document ID: 1149.90068
author: Temel Öncan
author: Jean-François Cordeau
author: G. Laporte
published in: European Journal of Operational Research
publication date: 2008-07-21T00:00:00Z
Mathematics Subject Classification ID: 90B40
zbMATH DE Number: 5303221
zbMATH Keywords: generalized minimum spanning tree
zbMATH Keywords: tabu search
describes a project that uses: TSPLIB
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: j.ejor.2007.08.021
OpenAlex ID: W2017602820
cites work: Q3056948
cites work: The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
cites work: Generalized spanning trees
cites work: Solving group Steiner problems as Steiner problems.
cites work: A comparative analysis of several formulations for the generalized minimum spanning tree problem
cites work: The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
cites work: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
cites work: Future paths for integer programming and links to artificial intelligence
cites work: Q4354785
cites work: Heuristic search for the generalized minimum spanning tree problem
cites work: A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem
cites work: Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm
cites work: Upper and lower bounding strategies for the generalized minimum spanning tree problem
cites work: Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
cites work: The Steiner tree problem
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: On the generalized minimum spanning tree problem
cites work: Q4448919
cites work: On the prize-collecting generalized minimum spanning tree problem
cites work: A new relaxation method for the generalized minimum spanning tree problem
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: Parallel iterative search methods for vehicle routing problems
cites work: Q3874241
DOI: 10.1016/J.EJOR.2007.08.021
description: scientific article; zbMATH DE number 5303221