Pages that link to "Item:Q4686678"
From MaRDI portal
The following pages link to Algorithms for node‐weighted Steiner tree and maximum‐weight connected subgraph (Q4686678):
Displaying 7 items.
- Finding dense subgraphs with maximum weighted triangle density (Q2666852) (← links)
- On the Exact Solution of Prize-Collecting Steiner Tree Problems (Q5085996) (← links)
- Optimal connected subgraphs: Integer programming formulations and polyhedra (Q6064164) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
- New formulations for two location problems with interconnected facilities (Q6128897) (← links)
- A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem (Q6164361) (← links)
- Models of random subtrees of a graph (Q6183888) (← links)