Local and variable neighborhood search for the \(k\) -cardinality subgraph problem
type: Item
instance of: scholarly article
title: Local and variable neighborhood search for the \(k\) -cardinality subgraph problem
zbMATH Open document ID: 1211.90298
author: Jack Brimberg
author: Nenad Mladenović
author: Dragan Urošević
published in: Journal of Heuristics
publication date: 2008-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5366818
zbMATH Keywords: variable neighborhood search
zbMATH Keywords: \(k\)-subgraph
describes a project that uses: K_TREE/K_SUBGRAPH
MaRDI profile type: Publication
full work available at URL: s10732-007-9046-y
OpenAlex ID: W2141809992
cites work: Local search algorithms for the \(k\)-cardinality tree problem.
cites work: \(K\)-tree/\(K\)-subgraph: A program package for minimal weighted \(K\)-cardinlity trees and subgraphs
cites work: Weighted k‐cardinality trees: Complexity and polyhedral structure
cites work: Variable neighborhood search: Principles and applications
cites work: Variable Neighborhood Search
cites work: Q4216482
cites work: Variable neighborhood search
cites work: Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem
DOI: 10.1007/S10732-007-9046-Y
description: scientific article; zbMATH DE number 5366818