stprbh

swMATH31781MaRDI QIDQ43492

No author found.

Described by source

• A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints

Related Items (3)

Layered graph approaches for combinatorial optimization problems ⋮ Exact algorithms for budgeted prize-collecting covering subgraph problems ⋮ Benders decomposition for network design covering problems

This page was built for software: stprbh