Pages that link to "Item:Q2427392"
From MaRDI portal
The following pages link to The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392):
Displaying 9 items.
- Lagrangian and branch-and-cut approaches for upgrading spanning tree problems (Q1652284) (← links)
- A relax-and-cut framework for large-scale maximum weight connected subgraph problems (Q1652399) (← links)
- Algorithmic expedients for the prize collecting Steiner tree problem (Q1952504) (← links)
- Exact approaches for solving robust prize-collecting Steiner tree problems (Q2355891) (← links)
- Optimal solution of the discrete cost multicommodity network design problem (Q2518654) (← links)
- Strength of Three MIP Formulations for the Prize Collecting Steiner Tree Problem with a Quota Constraint (Q2883603) (← links)
- Stabilizing branch‐and‐price for constrained tree problems (Q5326785) (← links)
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods (Q6070422) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
