Reduction tests for the prize-collecting Steiner problem

This article introduces a proper redefinition of the concept of bottleneck Steiner distance for the Prize-Collecting Steiner Problem. This allows the application of reduction tests known to be effective on Steiner Problem in Graphs in their full power. Computational experiments attest the effectiveness of the proposed tests. keywords Steiner Problem, Network Design, Preprocessing, Combinatorial Optimization

• Type: Journal
• Year: 2006
• Where: ORL
• Authors: Eduardo Uchoa
• Keywords: Bottleneck Steiner Distance, ORL 2006, Prize-Collecting Steiner Problem, Steiner Problem