The following pages link to (Q4216482):
Displaying 11 items.
- Revisiting dynamic programming for finding optimal subtrees in trees (Q856203) (← links)
- Local and variable neighborhood search for the \(k\) -cardinality subgraph problem (Q953319) (← links)
- The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation (Q987675) (← 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)
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← 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)
