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

European Journal of Operational Research

Volumn 190, Issue 1, 2008, Pages 68-78

  Costa, Alysson M ^a,b   Cordeau, Jean François ^b   Laporte, Gilbert ^b  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b HEC MONTRÉAL   (Canada)

Author keywords

Budget; Heuristics; Hop constraints; Network design; Prize collecting; Steiner tree problem; Tabu search

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; NETWORK ARCHITECTURE; PROBLEM SOLVING; TABU SEARCH; TREES (MATHEMATICS);

COMPUTATIONAL RESULTS; FAST HEURISTICS; HOP CONSTRAINTS; PRIZE COLLECTING; STEINER TREE PROBLEMS;

HEURISTIC ALGORITHMS;

EID: 41149180695     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.06.012     Document Type: Article

References (23)

1. Avella P., Villacci D., and Sforza A. A Steiner arborescence model for the feeder reconfiguration in electric distribution networks. European Journal of Operational Research 164 (2005) 505-509
2. Balakrishnan A., and Altinkemer K. Using a hop-constrained model to generate alternative communication network design. ORSA Journal on Computing 4 (1992) 192-205
3. Beasley J.E. OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society 41 (1990) 1069-1072
4. Canuto S.A., Resende M.G.C., and Ribeiro C.C. Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks 38 (2001) 50-58
5. Carneiro M.S., França P., and Silveira P.D. Long-range planning of power distribution systems: secondary networks. Computers and Electrical Engineering 22 3 (1996) 179-191
6. Cordeau J.-F., Gendreau M., Laporte G., Potvin J.-Y., and Semet F. A guide to vehicle routing heuristics. Journal of the Operational Research Society 53 (2002) 512-522
7. Costa, A.M., Cordeau, J.-F., Laporte, G., 2006a . Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints, Publication CRT-2006-16, Centre for Research on Transportation, Montreal.
8. Costa A.M., Cordeau J.-F., and Laporte G. Steiner tree problems with profits. INFOR 44 (2006) 99-115
9. Costa, A.M., Cordeau, J.-F., Laporte, G., forthcoming. Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints, Networks.
10. Cunha, A.S., Lucena, A., Maculan, N., Resende, M.G.C., 2003. A relax and cut algorithm for the prize collecting Steiner problem in graphs, In: Proceedings of Mathematical Programming in Rio, Búzios, Brazil, pp. 72-78.
11. Gendreau M., Hertz A., and Laporte G. A tabu search heuristic for the vehicle routing problem. Management Science 40 (1994) 1276-1290
12. Gouveia L. Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints. Computers & Operations Research 22 (1995) 959-970
13. Gouveia L. Multicommodity flow models for spanning trees with hop constraints. European Journal of Operational Research 95 (1996) 178-190
14. Gouveia L. Using variable redefinition for computing lower bounds for minimum spanning and Steiner trees with hop constraints. INFORMS Journal on Computing 10 (1998) 180-188
15. Gouveia L., and Magnanti T.L. Network flow models for designing diameter-constrained minimum-spanning and Steiner trees. Networks 41 (2003) 159-173
16. Gouveia L., and Requejo C. A new Lagrangian relaxation approach for the hop-constrained minimum spanning tree problem. European Journal of Operational Research 132 (2001) 539-552
17. Lawler E. Combinatorial Optimization: Networks and Matroids (1976), Holt, Rinehart and Winston, New York
18. LeBlanc L., Chifflet J., and Mahey P. Packet routing in telecommunication networks with path and flow restrictions. INFORMS Journal on Computing 11 (1999) 188-197
19. Ljubić, I., Weiskircher, R., Pferschy, U., Klau, G., Mutzel, P., Fischetti, M., 2005. Solving the prize-collecting Steiner tree problem to optimality, Proceedings of ALENEX, Seventh Workshop on Algorithm Engineering and Experiments, Vancouver.
20. Pisinger, D., Ropke, S., 2007. A general heuristic for vehicle routing problems. Computers & Operations Research (forthcoming).
21. Ropke, S., Pisinger, D., 2006. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science (forthcoming).
22. Voß S. The Steiner tree problem with hop constraints. Annals of Operations Research 86 (1999) 321-345
23. Voß S. Steiner tree problems in telecomunications. In: Pardalos P., and Resende M.G.C. (Eds). Handbooks of Telecommunications (2006), Springer, New York