A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem

References

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