Pages that link to "Item:Q1811129"

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

Displaying 11 items.

• A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem (Q274945) (← links)
• 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)
• 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)