Pages that link to "Item:Q2483504"
From MaRDI portal
The following pages link to The multi-weighted Steiner tree problem: A reformulation by intersection (Q2483504):
Displaying 6 items.
- Branch-and-price algorithm for the resilient multi-level hop-constrained network design (Q297189) (← links)
- A strong symmetric formulation for the min-degree constrained minimum spanning tree problem (Q325449) (← links)
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm (Q496663) (← links)
- Stronger path‐based extended formulation for the Steiner tree problem (Q6068530) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
- A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem (Q6164361) (← links)
