scientific article; zbMATH DE number 1215044
From MaRDI portal
Publication:4216482
Recommendations
- Local search algorithms for the \(k\)-cardinality tree problem.
- scientific article; zbMATH DE number 1195632
- Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem
- Weighted k‐cardinality trees: Complexity and polyhedral structure
- scientific article; zbMATH DE number 1538542
Cited in
(16)- 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.
- An application of tabu search heuristic for the maximum edge-weighted subgraph 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
- Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem
- 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
- scientific article; zbMATH DE number 1195632 (Why is no real title available?)
- Tabu Search and Ejection Chains—Application to a Node Weighted Version of the Cardinality-Constrained TSP
- Weighted A^* search - unifying view and application
- 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
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4216482)
