An exact algorithm for the node weighted Steiner tree problem

DOI10.1007/s10288-005-0081-yzbMath1112.68106OpenAlexW1968741818MaRDI QIDQ876575

Marco Trubian, Roberto Cordone

Publication date: 19 April 2007

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-005-0081-y

zbMATH Keywords

Steiner problemrelax-and-cutprize collecting

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Solving the quadratic minimum spanning tree problem ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives

This page was built for publication: An exact algorithm for the node weighted Steiner tree problem