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 16 items.
- Risk models for the prize collecting Steiner tree problems with interval data (Q403434) (← links)
- A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs (Q1025987) (← links)
- 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)
- 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 approaches for solving robust prize-collecting Steiner tree problems (Q2355891) (← links)
- A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem (Q2496025) (← links)
- Optimal solution of the discrete cost multicommodity network design problem (Q2518654) (← links)
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem (Q2583134) (← links)
- Strength of three MIP formulations for the prize collecting Steiner tree problem with a quota constraint (Q2883603) (← links)
- A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem (Q2942688) (← links)
- Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree (Q5012805) (← 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)
