Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints

Authors:
Alysson M. Costa;Jean-François Cordeau;Gilbert Laporte
Affiliations:
HEC Montréal, 3000 Chemin de la Côte-Sainte-Catherine, Montréal, Canada H3T 2A7;HEC Montréal, 3000 Chemin de la Côte-Sainte-Catherine, Montréal, Canada H3T 2A7;HEC Montréal, 3000 Chemin de la Côte-Sainte-Catherine, Montréal, Canada H3T 2A7
Venue:
Networks - Special Issue on Trees
Year:
2009

Citing 0
Cited 5

Solving connected subgraph problems in wildlife conservation

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Tight compact models and comparative analysis for the prize collecting Steiner tree problem

Discrete Applied Mathematics
Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem

INFORMS Journal on Computing
Natural and extended formulations for the Time-Dependent Traveling Salesman Problem

Discrete Applied Mathematics
The Steiner Tree Problem with Delays: A compact formulation and reduction procedures

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Steiner tree problem with revenues, budget and hop constraints is a variant of the Steiner tree problem with two main modifications: (a) besides the costs associated with arcs, there are also revenues associated with the vertices, and (b) there are additional budget and hop constraints, which impose limits on the total cost of the network and on the number of edges between any vertex and the root, respectively. This article introduces and compares several mathematical models for this problem and describes two branch-and-cut algorithms, which solve to optimality instances with up to 500 vertices and 625 edges. © 2008 Wiley Periodicals, Inc. NETWORKS, 2009