The following pages link to (Q4208337):
Displaying 13 items.
- Revisiting dynamic programming for finding optimal subtrees in trees (Q856203) (← links)
- The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation (Q987675) (← links)
- \(K\)-tree/\(K\)-subgraph: A program package for minimal weighted \(K\)-cardinlity trees and subgraphs (Q1268220) (← links)
- Cardinality constrained minimum cut problems: complexity and algorithms. (Q1427809) (← links)
- Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem (Q1577113) (← links)
- New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem (Q1764754) (← links)
- Local search algorithms for the \(k\)-cardinality tree problem. (Q1811129) (← links)
- Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem (Q1885977) (← links)
- Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem (Q2434979) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem (Q2576247) (← links)
- Integer Programming Formulations for the k-Cardinality Tree Problem (Q3503557) (← links)
- Simple heuristics for the rooted max tree coverage problem (Q6606188) (← links)
