Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem

DOI10.1016/j.ejor.2004.07.061zbMath1087.90061OpenAlexW2073202630MaRDI QIDQ2576247

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

Publication date: 27 December 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.07.061

zbMATH Keywords

combinatorial optimizationmetaheuristicsvariable neighborhood searchvertex weighted \(k\)-cardinality tree problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (14)

On the integrated charge planning with flexible jobs in primary steelmaking processes ⋮ Variable neighbourhood search for bandwidth reduction ⋮ Variable neighborhood search for the pharmacy duty scheduling problem ⋮ Variable neighborhood search variants for min-power symmetric connectivity problem ⋮ General variable neighborhood search for the parallel machine scheduling problem with two common servers ⋮ Integer Programming Formulations for the k-Cardinality Tree Problem ⋮ Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem ⋮ Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem ⋮ General variable neighborhood search for the continuous optimization ⋮ Variable neighbourhood search: methods and applications ⋮ Neighborhood structures for the container loading problem: a VNS implementation ⋮ The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation ⋮ VNS and second order heuristics for the min-degree constrained minimum spanning tree problem ⋮ Variable neighbourhood search: Methods and applications

Uses Software

• J-MEANS
• K_TREE/K_SUBGRAPH

Cites Work

• Unnamed Item
• Unnamed Item
• \(K\)-tree/\(K\)-subgraph: A program package for minimal weighted \(K\)-cardinlity trees and subgraphs
• A short note on the approximability of the maximum leaves spanning tree problem
• A new adaptive multi-start technique for combinatorial global optimizations
• Variable neighborhood search
• Local search algorithms for the \(k\)-cardinality tree problem.
• Variable neighborhood decomposition search
• 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: Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem