Pages that link to "Item:Q2883603"
From MaRDI portal
The following pages link to Strength of three MIP formulations for the prize collecting Steiner tree problem with a quota constraint (Q2883603):
Displaying 5 items.
- A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem (Q1651621) (← links)
- Tight compact models and comparative analysis for the prize collecting Steiner tree problem (Q1941390) (← links)
- Algorithmic expedients for the prize collecting Steiner tree problem (Q1952504) (← links)
- Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
- Stronger MIP formulations for the Steiner forest problem (Q2227541) (← links)