Transformations for the Prize-Collecting Steiner Tree Problem and the Maximum-Weight Connected Subgraph Problem to SAP
From MaRDI portal
Publication:4688185
DOI10.4208/jcm.1709-m2017-0002zbMath1413.90228OpenAlexW2481380102MaRDI QIDQ4688185
Thorsten Koch, Daniel Rehfeldt
Publication date: 22 October 2018
Published in: Journal of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0b34b0f7f862200015dc83bec12a9a8f0c4edd58
graph transformationsprize-collecting Steiner tree problemmaximum-weight connected subgraph problemdual-ascent heuristics
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
On the Exact Solution of Prize-Collecting Steiner Tree Problems, SCIP-Jack -- a solver for STP and variants with parallelization extensions, Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem
Uses Software
