Pages that link to "Item:Q2270325"
From MaRDI portal
The following pages link to A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem (Q2270325):
Displayed 5 items.
- The Steiner tree problem with delays: a compact formulation and reduction procedures (Q496653) (← links)
- A branch-and-cut algorithm for the Steiner tree problem with delays (Q1926621) (← links)
- Finding outbreak trees in networks with limited information (Q2357924) (← links)
- Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints (Q3466769) (← links)
- A Lagrangean-based decomposition approach for the link constrained Steiner tree problem (Q4637834) (← links)