Pages that link to "Item:Q1652399"

The following pages link to A relax-and-cut framework for large-scale maximum weight connected subgraph problems (Q1652399):

Displaying 3 items.

• Imposing Contiguity Constraints in Political Districting Models (Q5080650) (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
• Vertex covering with capacitated trees (Q6179715) (← links)