| Article ID: | iaor2007911 |
| Country: | Netherlands |
| Volume: | 34 |
| Issue: | 4 |
| Start Page Number: | 437 |
| End Page Number: | 444 |
| Publication Date: | Jul 2006 |
| Journal: | Operations Research Letters |
| Authors: | Uchoa Eduardo |
| Keywords: | Steiner problem |
This article introduces a proper redifinition 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 to the effectiveness of the proposed tests.