Pages that link to "Item:Q987675"

The following pages link to The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation (Q987675):

Displaying 9 items.

• Extended formulations for the cardinality constrained subtree of a tree problem (Q833578) (← links)
• Computational approaches for zero forcing and related problems (Q1631510) (← links)
• On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem (Q1789587) (← links)
• Connected power domination in graphs (Q2424811) (← links)
• Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem (Q2434979) (← links)
• New branch-and-bound algorithms for \(k\)-cardinality tree problems (Q2840678) (← links)
• Algorithms for the Maximum Weight Connected $$k$$-Induced Subgraph Problem (Q2942405) (← links)
• Integer Programming Formulations for the k-Cardinality Tree Problem (Q3503557) (← links)
• An integer program for positive semidefinite zero forcing in graphs (Q6092625) (← links)