Pages that link to "Item:Q1694297"
From MaRDI portal
The following pages link to A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints (Q1694297):
Displaying 12 items.
- stprbh (Q43492) (← links)
- Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
- Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
- Breakout local search for the Steiner tree problem with revenue, budget and hop constraints (Q2255904) (← links)
- Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints (Q2482819) (← links)
- Benders decomposition for network design covering problems (Q2669611) (← links)
- Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints (Q3466769) (← links)
- A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints (Q5232757) (← links)
- Modelling the hop constrained connected facility location problem on layered graphs (Q5891541) (← links)
- Models for a Steiner ring network design problem with revenues (Q5943555) (← links)
- A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints (Q6066244) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
