Pages that link to "Item:Q1417851"
From MaRDI portal
The following pages link to Solving Steiner tree problems in graphs with Lagrangian relaxation (Q1417851):
Displaying 6 items.
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190) (← links)
- Traffic engineering of tunnel-based networks with class specific diversity requirements (Q857786) (← links)
- A factoring approach for the Steiner tree problem in undirected networks (Q881873) (← links)
- A Lagrangian bound for many-to-many assignment problems (Q975754) (← links)
- The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation (Q987675) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
