Solving the Orienteering Problem through Branch-and-Cut

References

• Balas E. The Prize Collecting Traveling Salesman Problem. Networks (1989) 19 621 636 Crossref, Google Scholar
• Balas E. The Prize Collecting Traveling Salesman Problem. II. Polyhedral Results. (1993) . Working paper, GSIA, Carnegie Mellon University, Pittsburgh Google Scholar
• Balas E. On the Cycle Polytope of a Directed Graph. (1993) . Working paper, GSIA, Carnegie Mellon University, Pittsburgh Google Scholar
• Balas E. , Martin G. ROLL-A-ROUND: Software Package for Scheduling the Rounds of a Rolling Mill. (1985) (Balas and Martin Associates, 104 Maple Heights Road, Pittsburgh, PA) . Copyright Google Scholar
• Bauer P. The Cycle Polytope: Facets. Mathematics of Operations Research (1997) 22 110 145 Link, Google Scholar
• Chao I.-M. , Golden B. L. , Wasil E. A. A Fast and Effective Heuristic for the Orienteering Problem. European Journal of Operational Research (1996) 88 475 489 Crossref, Google Scholar
• Christofides N. , Mingozzi A. , Toth P. , Christofides N. , Mingozzi A. , Toth P. , Sandi C. The Vehicle Routing Problem. Combinatorial Optimization (1979) (Wiley, Chichester, UK) 315 338 Google Scholar
• Diaby M. , Ramesh R. The Distribution Problem with Carrier Service: A Dual Based Penalty Approach. ORSA Journal on Computing (1995) 7 24 35 Link, Google Scholar
• Dongarra J. J. Performance of Various Computers Using Standard Linear Equations Software. (1996) . Report CS-89-85, University of Tennessee, Knoxville Google Scholar
• Fischetti M. , Toth P. , Golden B. L. , Assad A. A. An Additive Approach for the Optimal Solution of the Prize-Collecting Traveling Salesman Problem. Vehicle Routing: Methods and Studies (1988) (North Holland, Amsterdam) 319 343 Google Scholar
• Gendreau M. , Laporte G. , Semet F. A Branch-and-Cut Algorithm for the Undirected Selective Traveling Salesman Problem. (1995) . Working paper CRT-95-80, Centre de recherche sur les transports, Montréal Google Scholar
• Golden B. L. , Levy L. , Vohra R. The Orienteering Problem. Naval Research Logistics (1987) 34 307 318 Crossref, Google Scholar
• Golden B. L. , Wang Q. , Liu L. A Multifaceted Heuristic for the Orienteering Problem. Naval Research Logistics (1988) 35 359 366 Crossref, Google Scholar
• Jünger M. , Reinelt G. , Rinaldi G. , Ball M. , Magnanti T. L. , Monma C. L. , Nemhauser G. The Traveling Salesman Problem. Handbooks in Operations Research and Management Science, Network Models (1995) 7 (North Holland, Amsterdam) 225 330 Google Scholar
• Laporte G. , Martello S. The Selective Traveling Salesman Problem. Discrete Applied Mathematics (1990) 26 193 207 Crossref, Google Scholar
• Leifer A. C. , Rosenwein M. B. Strong Linear Programming Relaxations for the Orienteering Problem. European Journal Operational Research (1994) 73 517 523 Crossref, Google Scholar
• Martello S. , Toth P. Knapsack Problems: Algorithms and Computer Implementations (1990) (John Wiley & Sons, Chichester, UK) Google Scholar
• Nemhauser G. L. , Wolsey L. A. Integer and Combinatorial Optimization (1988) (Wiley, New York) Crossref, Google Scholar
• Padberg M. W. , Rao M. R. Odd minimum cut-sets and b-matchings. Mathematics of Operations Research (1982) 7 67 80 Link, Google Scholar
• Padberg M. W. , Rinaldi G. A branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems. SIAM Review (1991) 33 60 100 Crossref, Google Scholar
• Ramesh R. , Brown K. M. An Efficient Four-phase Heuristic for the Generalized Orienteering Problem. Computers & Operations Research 18 151 165 Crossref, Google Scholar
• Ramesh R. , Yoon Y.-S. , Karwan M. H. An Optimal Algorithm for the Orienteering Tour Problem. ORSA Journal on Computing (1992) 4 155 165 Link, Google Scholar
• Reinelt G. TSPLIB—A Traveling Salesman Problem Library. ORSA Journal on Computing (1991) 3 376 384 Link, Google Scholar
• Rosenkrantz D. J. , Stearns R. E. , Lewis II P. M. An Analysis of Several Heuristics for the Traveling Salesman Problem. SIAM Journal on Computing 6 563 581 Crossref, Google Scholar
• Tsiligirides T. Heuristic Methods Applied to Orienteering. Journal of the Operational Research Society (1984) 35 797 809 Crossref, Google Scholar