A branch-and-cut algorithm for the undirected traveling purchaser problem

Operations Research

Volumn 51, Issue 6, 2003, Pages 940-951+1004

  Laporte, Gilbert ^a   Riera Ledesma, Jorge ^b   Salazar González, Juan José ^b  

^a HEC MONTRÉAL   (Canada)

^b UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

Networks graphs: traveling salesman; Transportation: vehicle routing

Indexed keywords

ALGORITHMS; COST BENEFIT ANALYSIS; LINEAR PROGRAMMING; MARKETING; OPTIMIZATION; PROBLEM SOLVING; PRODUCTION; PURCHASING;

BRANCH-AND-CUT ALGORITHMS; LINEAR RELAXATION; TRAVELING PURCHASER PROBLEMS;

TRAVELING SALESMAN PROBLEM;

EID: 4344699366     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.51.6.940.24921     Document Type: Article

References (20)

1. Balas, E., S. M. Ng. 1989. On the set covering polytope: I. All the facets with coefficients in {0, 1, 2}. Math. Programming 43 57-69.
2. _, P. Toth. 1985. Branch and bound methods. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys, eds. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, Chichester, U.K., 361-401.
3. Bauer, P. 1997. The circuit polytope: Facets. Math. Oper. Res. 22 110-145.
4. Burstall, R. M. 1966. A heuristic method for a job sequencing problem. Oper. Res. Quart. 17 291-304.
5. Buzacott, J. A., S. K. Dutta. 1971. Sequencing many jobs on a multipurpose facility. Naval Res. Logist. Quart. 18 75-82.
6. Caprara, A., M. Fischetti. 1997. Branch-and-cut algorithms. M. Dell'Amico, F. Maffioli, S. Martello, eds. Annotated Bibliographies in Combinatorial Optimization. Wiley, Chichester, U.K.
7. Crowder, H., E. L. Johnson, M. W. Padberg. 1983. Solving large-scale zero-one linear programming problems. Oper. Res. 31 803-834.
8. Fischetti, M., J. J. Salazar, P. Toth. 1995. The symmetric generalized travelling salesman polytope. Networks 26 113-123.
9. _, _, _. 1997. A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Oper. Res. 45 378-394.
10. Golden, B. L., L. Levy, R. Dahl. 1981. Two generalizations of the traveling salesman problem. Omega 9 439-445.
11. Jünger, M., S. Thienel. 1998. Introduction to ABACUS - A Branch-And-CUt System. Oper. Res. Lett. 22 83-95.
12. _, G. Reinelt, G. Rinaldi. 1995. The traveling salesman problem. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Handbooks in Operations Research and Management Science: Network Models. North-Holland, Amsterdam, The Netherlands, 225-330.
13. Karg, R. L., G. L. Thompson. 1964. A heuristic approach to solving the traveling salesman problem. Management Sci. 10 225-248.
14. Martello, S., P. Toth. 1990. Knapsack Problems: Algorithms and Computer Implementations. Wiley, Chichester, U.K.
15. Naddef, D. 2002. Polyhedral theory and branch-and-cut algorithms for the symmetric TSP G. Gutin, A. Punnen, eds. The Traveling Salesman Problem and Its Variants. Kluwer, Dordrecht, The Netherlands, 29-116.
16. Ong, H. L. 1982. Approximate algorithms for the traveling purchaser problem. Oper. Res. Lett. 1 201-205.
17. Padberg, M. W., M. R. Rao. 1982. Odd minimum cut-sets and b-matchings. Math. Oper. Res. 7 67-80.
18. Pearn, W. L., R. C. Chien. 1998. Improved solutions for the traveling purchaser problem. Comput. Oper. Res. 25 879-885.
19. Ramesh, T. 1981. Traveling purchaser problem. Opsearch 18 78-91.
20. Singh, K. N., D. L. van Oudheusden. 1997. A branch and bound algorithm for the traveling purchaser problem. Eur. J. Oper. Res. 97 571-579.