Pages that link to "Item:Q2434979"

The following pages link to Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem (Q2434979):

Displaying 10 items.

• Polyhedral properties of the \(K\)-median problem on a tree (Q879965) (← links)
• The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation (Q987675) (← links)
• On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem (Q1789587) (← links)
• Isolation branching: a branch and bound algorithm for the \(k \)-terminal cut problem (Q2082183) (← links)
• New branch-and-bound algorithms for \(k\)-cardinality tree problems (Q2840678) (← links)
• A branch-and-cut algorithm for the k-edge connected subgraph problem (Q3057129) (← links)
• Integer Programming Formulations for the k-Cardinality Tree Problem (Q3503557) (← links)
• Weighted <i>k</i>‐cardinality trees: Complexity and polyhedral structure (Q4291481) (← links)
• (Q5264741) (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)