Pages that link to "Item:Q1651621"
From MaRDI portal
The following pages link to A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem (Q1651621):
Displaying 3 items.
- A relax-and-cut framework for large-scale maximum weight connected subgraph problems (Q1652399) (← links)
- A fast prize-collecting Steiner forest algorithm for functional analyses in biological networks (Q2011601) (← links)
- On the Exact Solution of Prize-Collecting Steiner Tree Problems (Q5085996) (← links)