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

@article{Costa2009ModelsAB, title={Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints}, author={A. M. Costa and J. Cordeau and G. Laporte}, journal={Networks}, year={2009}, volume={53}, pages={141-159} }

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… CONTINUE READING

20 Citations

Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints

- Mathematics, Computer Science
- 2008

- 41
- PDF

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

- Mathematics, Computer Science
- 2014

- 15
- PDF

Breakout local search for the Steiner tree problem with revenue, budget and hop constraints

- Mathematics, Computer Science
- 2014

- 19
- Highly Influenced
- PDF

Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem

- Computer Science, Mathematics
- 2013

- 29
- PDF

Solving the steiner tree problem with revenues, budget and hop constraints to optimality

- Mathematics
- 2013

- 6

An efficient algorithm for the Steiner Tree Problem with revenue, bottleneck and hop objective functions

- Computer Science, Mathematics
- 2010

- 6

A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints

- Computer Science, Mathematics
- 2016

- 4
- Highly Influenced
- PDF

Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints

- Computer Science, Mathematics
- 2015

- 9
- PDF

Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints

- Mathematics, Computer Science
- 2012

- 64
- PDF

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 51 REFERENCES

The prize collecting Steiner tree problem: theory and practice

- Computer Science
- 2000

- 255
- Highly Influential

A general approximation technique for constrained forest problems

- Mathematics, Computer Science
- 1992

- 870
- PDF

Solving the Prize-Collecting Steiner Tree Problem to Optimality

- Mathematics, Computer Science
- 2005

- 44
- Highly Influential
- PDF

Local search with perturbations for the prize-collecting Steiner tree problem in graphs

- Computer Science, Mathematics
- 2001

- 154
- PDF