Publication:4216482
From MaRDI portal
zbMath0909.90265MaRDI QIDQ4216482
Arne Løkketangen, Kurt O. Jørnsten
Publication date: 26 October 1998
tabu search; facility layout; subtree; undirected weighted graph; minimum weighted \(k\)-cardinality tree problem
Related Items
Revisiting dynamic programming for finding optimal subtrees in trees, Local and variable neighborhood search for the \(k\) -cardinality subgraph problem, The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation, Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem, New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem, Local search algorithms for the \(k\)-cardinality tree problem., Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem, The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches, An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints, Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem, Integer Programming Formulations for the k-Cardinality Tree Problem