stprbh

MaRDI QIDQ43492swMATHFDO

Official website https://homepage.univie.ac.at/markus.sinnl/program-codes/stprbh/

Described by source

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

Cited in

(3)

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

This page was built for software: stprbh