scientific article; zbMATH DE number 1215044
From MaRDI portal
Publication:4216482
zbMath0909.90265MaRDI QIDQ4216482
Arne Løkketangen, Kurt O. Jørnsten
Publication date: 26 October 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
tabu searchfacility layoutsubtreeundirected weighted graphminimum weighted \(k\)-cardinality tree problem
Related Items (12)
Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem ⋮ Revisiting dynamic programming for finding optimal subtrees in trees ⋮ Integer Programming Formulations for the k-Cardinality Tree Problem ⋮ The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches ⋮ Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem ⋮ Local and variable neighborhood search for the \(k\) -cardinality subgraph problem ⋮ New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem ⋮ An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints ⋮ The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation ⋮ Local search algorithms for the \(k\)-cardinality tree problem. ⋮ Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem ⋮ Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem
This page was built for publication:
