stprbh

swMATH31781MaRDI QIDQ43492FDOQ43492

Author name not available (Why is that?)

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