Local search algorithms for the \(k\)-cardinality tree problem.
type: Item
instance of: scholarly article
title: Local search algorithms for the \(k\)-cardinality tree problem.
zbMATH Open document ID: 1038.90085
DOI: 10.1016/S0166-218X(02)00548-6
author: Christian Blum
author: Matthias Ehrgott
published in: Discrete Applied Mathematics
publication date: 2003-06-10T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1925302
zbMATH Keywords: Combinatorial optimization
zbMATH Keywords: \(k\)-cardinality tree
zbMATH Keywords: Tabu search
zbMATH Keywords: Genetic algorithm
zbMATH Keywords: Local search
describes a project that uses: K_TREE/K_SUBGRAPH
MaRDI profile type: Publication
cites work: Q4339078
cites work: Q4234074
cites work: New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
cites work: Q4234076
cites work: A constant-factor approximation algorithm for the \(k\)-MST problem
cites work: Solution of the cumulative assignment problem with a well-structured tabu search method
cites work: The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices
cites work: \(K\)-tree/\(K\)-subgraph: A program package for minimal weighted \(K\)-cardinlity trees and subgraphs
cites work: Q4208337
cites work: Faster geometric \(k\)-point MST approximation
cites work: Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints
cites work: Weighted k‐cardinality trees: Complexity and polyhedral structure
cites work: An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: A framework for the description of evolutionary algorithms
cites work: Q4216482
cites work: Spanning Trees—Short or Small
cites work: Q4875213
cites work: Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
cites work: Metaheuristics: A bibliography
cites work: Q4274209
full work available at URL: s0166-218x(02)00548-6
OpenAlex ID: W2017765977
Recommended article: Q3439802
Recommended article: Finding good tree decompositions by local search
Recommended article: Q4216482
Recommended article: New branch-and-bound algorithms for \(k\)-cardinality tree problems
Recommended article: Local and variable neighborhood search for the \(k\) -cardinality subgraph problem
Recommended article: Q3696857
Recommended article: Local algorithms for block-tree problems of discrete programming
Recommended article: Q3059322
Recommended article: Local search and the local structure of NP-complete problems
description: scientific article; zbMATH DE number 1925302