Pages that link to "Item:Q1577113"

The following pages link to Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem (Q1577113):

Displaying 6 items.

• The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation (Q987675) (← 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)
• New branch-and-bound algorithms for k-cardinality tree problems (Q2840678) (← links)
• Integer Programming Formulations for the k-Cardinality Tree Problem (Q3503557) (← links)