New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem
type: Item
instance of: scholarly article
title: New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem
zbMATH Open document ID: 1107.90044
author: Christian Blum
author: Maria J. Blesa
published in: Computers \& Operations Research
publication date: 2005-02-22T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 2136902
zbMATH Keywords: \(k\)-cardinality tree problem
zbMATH Keywords: Metaheuristics
zbMATH Keywords: Combinatorial optimization
zbMATH Keywords: Ant Colony Optimization
zbMATH Keywords: Evolutionary computation
zbMATH Keywords: Tabu search
zbMATH Keywords: Spanning trees
describes a project that uses: HC-ACO
describes a project that uses: Tabu search
describes a project that uses: K_TREE/K_SUBGRAPH
MaRDI profile type: Publication
full work available at URL: j.cor.2003.11.007
OpenAlex ID: W2010597367
cites work: Integer programming approaches to facilities layout models with forbidden areas
cites work: Decomposing Matrices into Blocks
cites work: An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane
cites work: Weighted k‐cardinality trees: Complexity and polyhedral structure
cites work: Spanning Trees—Short or Small
cites work: Q4208337
cites work: \(K\)-tree/\(K\)-subgraph: A program package for minimal weighted \(K\)-cardinlity trees and subgraphs
cites work: Q4216482
cites work: Local search algorithms for the \(k\)-cardinality tree problem.
cites work: Future paths for integer programming and links to artificial intelligence
cites work: Q4354785
cites work: Q4331755
cites work: A framework for the description of evolutionary algorithms
cites work: Introduction to algorithms
DOI: 10.1016/J.COR.2003.11.007
Recommended article: Q4216482
Recommended article: New branch-and-bound algorithms for \(k\)-cardinality tree problems
Recommended article: NEW METAHEURISTIC APPROACHES FOR THE LEAF-CONSTRAINED MINIMUM SPANNING TREE PROBLEM
Recommended article: Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem
Recommended article: A metaheuristic approach to the dominating tree problem
Recommended article: Heuristic and metaheuristic methods for computing graph treewidth
Recommended article: Q4208337
Recommended article: Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem
Recommended article: Tree optimization based heuristics and metaheuristics in network construction problems
Recommended article: Weighted k‐cardinality trees: Complexity and polyhedral structure
description: scientific article; zbMATH DE number 2136902