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 2 items.

• On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem (Q1789587) (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)