Local and variable neighborhood search for the \(k\) -cardinality subgraph problem

DOI10.1007/s10732-007-9046-yzbMath1211.90298OpenAlexW2141809992MaRDI QIDQ953319

Nenad Mladenović, Jack Brimberg, Dragan Urošević

Publication date: 17 November 2008

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-007-9046-y

zbMATH Keywords

variable neighborhood search\(k\)-subgraph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

Variable neighborhood search for the travelling deliveryman problem ⋮ Variable neighbourhood search: methods and applications ⋮ Variable neighbourhood search: Methods and applications

Uses Software

• K_TREE/K_SUBGRAPH

Cites Work

• Unnamed Item
• \(K\)-tree/\(K\)-subgraph: A program package for minimal weighted \(K\)-cardinlity trees and subgraphs
• Variable neighborhood search
• Local search algorithms for the \(k\)-cardinality tree problem.
• Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem
• Weighted k‐cardinality trees: Complexity and polyhedral structure
• Variable Neighborhood Search
• Variable neighborhood search: Principles and applications

This page was built for publication: Local and variable neighborhood search for the \(k\) -cardinality subgraph problem