scientific article; zbMATH DE number 1424551

From MaRDI portal
Publication:4945800





The Steiner Problem in Graphs (SPG) is well-known to be NP hard. In order to tackle it with branch-and-bound or branch-and-cut methods it is therefore of vital importance to find good formulations by applying a set of preprocessing rules. In this paper the author describes the idea of preprocessing, in general and then with emphasis on the SPG. Four different ideas for preprocessing concepts are developed which improve upon preprocessing used for SPG so far. Further improvements can be obtained for each by exploiting vertex implied Steiner edges. The power of the theoretical results is confirmed by numerical tests which are reported at the end of the paper. For the entire collection see [Zbl 0932.00010].











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4945800)