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

DOI10.1016/S0305-0548(03)00073-XzbMath1068.68108MaRDI QIDQ1885977

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

Publication date: 12 November 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Variable neighbourhood search for bandwidth reduction, Revisiting dynamic programming for finding optimal subtrees in trees, Variable neighborhood search for the pharmacy duty scheduling problem, Hybrid Metaheuristics: An Introduction, Variable neighborhood search: the power of change and simplicity, Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem, Local and variable neighborhood search for the \(k\) -cardinality subgraph problem, Variable neighbourhood search: methods and applications, An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints, Variable neighbourhood search: Methods and applications, Less is more: Simplified Nelder-Mead method for large unconstrained optimization, New branch-and-bound algorithms for k-cardinality tree problems, Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Variable neighborhood search
• Local search algorithms for the \(k\)-cardinality tree problem.
• Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree
• Variable neighborhood decomposition search
• Weighted k‐cardinality trees: Complexity and polyhedral structure
• Variable neighborhood search: Principles and applications
• Reconstructing a minimum spanning tree after deletion of any node