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}
}
  • A. M. Costa, J. Cordeau, G. Laporte
  • Published 2009
  • Computer Science
  • Networks
  • 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

    Figures, Tables, and Topics from this paper.

    Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
    • 41
    • PDF
    Breakout local search for the Steiner tree problem with revenue, budget and hop constraints
    • 19
    • Highly Influenced
    • PDF
    Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem
    • 29
    • PDF
    A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints
    • 4
    • Highly Influenced
    • PDF
    Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
    • 64
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 51 REFERENCES
    The node-weighted steiner tree problem
    • A. Segev
    • Mathematics, Computer Science
    • 1987
    • 120
    Solving Steiner tree problems in graphs to optimality
    • 182
    • PDF
    Solving Steiner Tree Problems in Graphs to Optimality
    • 115
    • Highly Influential
    • PDF
    Steiner Tree Problems With Profits
    • 34
    • PDF
    The Steiner tree problem with hop constraints
    • S. Voß
    • Computer Science, Mathematics
    • 1999
    • 91
    • Highly Influential
    The prize collecting Steiner tree problem: theory and practice
    • 255
    • Highly Influential
    A general approximation technique for constrained forest problems
    • 870
    • PDF
    Solving the Prize-Collecting Steiner Tree Problem to Optimality
    • 44
    • Highly Influential
    • PDF
    Local search with perturbations for the prize-collecting Steiner tree problem in graphs
    • 154
    • PDF
    The Steiner tree polytope and related polyhedra
    • 106
    • PDF