Approximation algorithms for group prize-collecting and location-routing problems

Discrete Applied Mathematics

Volumn 156, Issue 17, 2008, Pages 3238-3247

  Glicksman, Hagai ^a   Penn, Michal ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Algorithm; Approximation; Group; Location; Prize collecting; Travelling salesman

Indexed keywords

BOOLEAN FUNCTIONS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; COST ACCOUNTING; COSTS; POLYNOMIAL APPROXIMATION; PROBABILITY DENSITY FUNCTION; ROUTING ALGORITHMS; TREES (MATHEMATICS);

APPROXIMATION; CARDINALITY; COMBINATORIAL OPTIMIZATION PROBLEMS; FIXED COSTS; GRAPH G; GROUP; LENGTH FUNCTIONS; PENALTY FUNCTIONS; PRIZE-COLLECTING; ROUTING PROBLEMS; STEINER TREE PROBLEMS; TRAVELLING SALESMAN; TRAVELLING SALESMAN PROBLEMS;

APPROXIMATION ALGORITHMS;

EID: 55049094522     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2008.05.013     Document Type: Article

References (25)

1. Balas E. The prize collecting travelling salesman problem. Networks 19 (1989) 621-636
2. Ben-Arieh D., Gutin G., Penn M., Yeo A., and Zverovitch A. Transformations of generalized ATSP into ATSP: Experimental and theoretical study. Operations Research Letters 31 (2003) 357-365
3. Bienstock D., Goemans M.X., Simchi-Levi D., and Williamson D.P. A note on the prize collecting travelling salesman problem. Mathematical Programming 59 (1993) 413-420
4. C. Chekury, G. Even, G. Kortsarz, An approximation algorithm for the group steiner problem, in: Proceedings of the Symposium on Discrete Algorithms SODA, San Francisco, California, 2002, pp. 49-58
5. Dror M., and Haurari M. Generalized steiner problem and other variants. Journal of Combinatorial Optimization 4 (2000) 415-436
6. P. Feofiloff, C.G. Fernandes, C.E. Ferreira, J. Pina, Approximation algorithm for the prize-collecting steiner tree problem, Manuscript, 2003
7. Feremans C., Labbe M., and Laporte G. A comparative analysis of several formulations for the generalized minimum spanning tree problem. Networks 39 1 (2002) 29-34
8. Feremans C., Labbe M., and Laporte G. Generalized network design problems. European Journal of Operational Research 148 (2003) 1-12
9. Frank A., and Tardos E. An application of simultaneous diophantine approximation in combinatorial approximation. Combinatorica 7 (1987) 49-65
10. Fischetti M., Salazar Gonzalez J.J., and Toth P. The generalized traveling salesman problem. In: Gutin G., and Punnen A. (Eds). The Traveling Salesman Problem and Its Variations (2002), Kluwer Academic Publishers 609-662
11. Golden B.L., and Assad A.A. Vehicle Routing: Methods and Studies (1991), North-Holland
12. Ghiani G., and Improta G. An efficient transformation of the generalized vehicle routing problem. European Journal of Operational Research 122 (2000) 11-17
13. Garg N., Konjevod G., and Ravi R. A polylogarithmic algorithm for the group steiner tree problem. Journal of Algorithms 37 1 (2000) 66-84
14. Grötschel M., Lovász L., and Schrijver A. Geometric Algorithms and Combinatorial Optimization (1988), Springer-Verlag, Berlin
15. Goemans M.X., and Williamson D.P. A general approximation technique for constrained forest problems. SIAM Journal on Computing 24 (1995) 296-317
16. Henry-Labordere A.I. The record balancing problem: A dynamic programming solution of the generalized traveling salesman problem. RIRO B-2 (1969) 43-49
17. E. Halperin, R. Krauthgamer, Polylogarithmic inapproximability, in: Proceedings of the 35th Annual ACM Symposium on Theory of Computing STOC, 2003, pp. 585-594
18. I. Kara, T. Bektas, Integer linear programming formulation of the generalized vehicle routing problem, Manuscript, 2004
19. Laporte G., Mercure H., and Nobert Y. Generalized travelling salesman problem through n sets of nodes: The asymmetrical cases. Discrete Applied Mathematics 18 (1987) 185-197
20. Laporte G., Nobert Y., and Pelletier P. Hamiltonian location problems. European Journal of Operational Research 12 (1983) 82-89
21. Myulg Y.-S., Lee C.-H., and Tcha D.-W. On the generalized minimum spanning tree problem. Networks 26 (1995) 231-241
22. Noon C.E., and Bean J.C. A Lagrangian based approach for the symmetric generalized travelling salesman problem. Operations Research 39 (1991) 623-632
23. Penn M., and Rozenfeld S. Approximation algorithm for the group Steiner network problem. Networks 49 2 (2007) 160-167
24. Reich G., and Widmayer P. Beyond Steiner's problem: A VLSI oriented generalization. Lecture Notes in Computer Science 411 (1989) 196-211
25. Wolsey L.A. Integer Programming (1998), Wiley- Interscience publication