| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142859 | Operations Research Letters | 2006 | 8 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Eduardo Uchoa,