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

DOI10.1007/s12532-016-0102-1zbMath1391.90421WikidataQ59471136 ScholiaQ59471136MaRDI QIDQ1694297

Ivana Ljubić, Markus Sinnl

Publication date: 1 February 2018

Published in: Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12532-016-0102-1

zbMATH Keywords

mixed integer programming; branch-and-cut; exact computation; node-based model; layered graph; hop-constrained trees

Mathematics Subject Classification ID

90C10: Integer programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C27: Combinatorial optimization

Related Items

stprbh

Uses Software

• SteinLib
• CPLEX
• OGDF
• OR-Library
• DIMACS