Facets of two Steiner arborescence polyhedra
Mathematical Programming: Series A and B
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
A note on the prize collecting traveling salesman problem
Mathematical Programming: Series A and B
The primal-dual method for approximation algorithms and its application to network design problems
Approximation algorithms for NP-hard problems
The prize collecting Steiner tree problem: theory and practice
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A comparison of Steiner tree relaxations
Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
Strong lower bounds for the prize collecting Steiner problem in graphs
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
Computational Optimization and Applications
A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
Discrete Applied Mathematics
A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
Computers and Operations Research
Tight compact models and comparative analysis for the prize collecting Steiner tree problem
Discrete Applied Mathematics
Hi-index | 0.00 |
This paper investigates the Prize Collecting Steiner Tree Problem (PCSTP) on a graph, which is a generalization of the well-known Steiner tree problem. Given a root node, edge costs, node prizes and penalties, as well as a preset quota, the PCSTP seeks to find a subtree that includes the root node and collects a total prize not smaller than the specified quota, while minimizing the sum of the total edge costs of the tree plus the penalties associated with the nodes that are not included in the subtree. For this challenging network design problem that arises in telecommunication settings, we present two valid 0-1 programming formulations and use them to develop preprocessing procedures for reducing the graph size. Also, we design an optimization-based heuristic that requires solving a PCSTP on a specific tree-subgraph. Although, this latter special case is shown to be NP-hard, it is effectively solvable in pseudo-polynomial time. The worst-case performance of the proposed heuristic is also investigated. In addition, we describe new valid inequalities for the PCSTP and embed all the aforementioned constructs in an exact row-generation approach. Our computational study reveals that the proposed approach can solve relatively large-scale PCSTP instances having up to 1000 nodes to optimality.