Pages that link to "Item:Q987675"
From MaRDI portal
The following pages link to The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation (Q987675):
Displayed 6 items.
- 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)
- Algorithms for the Maximum Weight Connected $$k$$-Induced Subgraph Problem (Q2942405) (← links)
- An integer program for positive semidefinite zero forcing in graphs (Q6092625) (← links)