Reduction tests for the prize-collecting Steiner problem

Authors:
Eduardo Uchoa
Affiliations:
Departamento de Engenharia de Produção, Universidade Federal Fluminense, Rua Passso da Pátria 156, Bl.E sala 440, Niterói, 24210-240, Brazil
Venue:
Operations Research Letters
Year:
2006

Citing 5
Cited 3

Problem reduction methods and a tree generation algorithm for the Steiner network problem

Networks
The prize collecting Steiner tree problem: theory and practice

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Improved algorithms for the Steiner problem in networks

Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
Extending Reduction Techniques for the Steiner Tree Problem

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Strong lower bounds for the prize collecting Steiner problem in graphs

Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics

Combinatorial optimization in system configuration design

Automation and Remote Control
A GRASP-based approach to the generalized minimum spanning tree problem

Expert Systems with Applications: An International Journal
Heuristic algorithms for solving survivability problem in the design of last mile communication networks

ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

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.