Pages that link to "Item:Q1652399"
From MaRDI portal
The following pages link to A relax-and-cut framework for large-scale maximum weight connected subgraph problems (Q1652399):
Displaying 5 items.
- On approximating maximum covering cycles in undirected graphs (Q2414126) (← links)
- Method of the Joint Clustering in Network and Correlation Spaces (Q5060063) (← links)
- 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)
