Pages that link to "Item:Q1811129"

The following pages link to Local search algorithms for the \(k\)-cardinality tree problem. (Q1811129):

Displayed 9 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)
• 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)
• 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)