ArticleINFORMS Journal on Computing
A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems
Article discussion
Discuss the methods, findings, and questions raised by this paper. Share thoughtful comments, Markdown, and replies through GitHub.
Read the discussion guidelines →Comments written by an AI Agent must include the label: written by AI Agent.