The Covering Tour Problem

Operations Research

Volumn 45, Issue 4, 1997, Pages 568-576

  Gendreau, Michel ^a   Laporte, Gilbert ^a   Semet, Frédéric ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS; INTEGER PROGRAMMING; LOGIC DESIGN; OPERATIONS RESEARCH; PROBLEM SOLVING; TRANSPORTATION;

HAMILTONIAN CYCLE; TRANSPORTATION PROBLEM;

GRAPH THEORY;

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

References (22)

1. ARKIN, E. M., AND R. HASSIN. 1994. Approximation Algorithms for the Geometric Covering Salesman Problem. Discrete Appl. Math. 55, 197-218.
2. ARKIN, E. M., M. M. HALLDÓRSSON, AND R. HASSIN. 1993. Approximating the Tree and Tour Covers of a Graph. Information Processing Letters, 47, 275-282.
3. BALAS, E. 1989. The Prize Collecting Traveling Salesman Problem. Networks, 19, 621-636.
4. BALAS, E. AND A. Ho. 1980. Set Covering Algorithms Using Cutting Planes, Heuristics, and Subgradient Optimization: A Computational Study. Math. Programming, 12, 37-60.
5. BALAS, E. AND S. M. NG. 1989. On the Set Covering Polytope: I. All the Facets with Coefficients in {0, 1, 2}. Math. Programming, 43, 57-69.
6. CPLEX OPTIMIZATION INC. 1993. Using the CPLEX Callable Library and CPLEX Mixed Integer Library.
7. CURRENT, J. R. 1981. Multiobjective Design of Transportation Networks. Ph.D. Thesis, Department of Geography and Environmental Engineering, The Johns Hopkins University.
8. CURRENT, J. R., H. PIRKUL, AND E. ROLLAND. 1994. Efficient Algorithms for Solving the Shortest Covering Path Problem. Transp. Sci. 28, 317-327.
9. CURRENT, J. R. AND D. A. SCHILLING. 1989. The Covering Salesman Problem. Transp. Sci. 23, 208-213.
10. CURRENT, J. R. AND D. A. SCHILLING. 1994. The Median Tour and Maximal Covering Problems. European J. Opnl. Res. 73, 114-126.
11. FISCHETTI, M., J. J. SALAZAR, AND P. TOTH. 1994. A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem. Working Paper, DEIS, University of Bologna.
12. FISCHETTI, M. AND P. TOTH. 1988. An Additive Approach for the Optimal Solution of the Prize-Collecting Traveling Salesman Problem. In Vehicle Routing: Methods and Studies. B. L. Golden and A. A. Assad (eds.). North-Holland, Amsterdam, 319-343.
13. GENDREAU, M., A. HERTZ, AND G. LAPORTE. 1992. New Insertion and Postoptimization Procedures for the Traveling Salesman Problem. Opus. Res. 40, 1086-1094.
14. GRÖTSCHEL, M. AND M. W. PADBERG. 1985. Polyhedral Theory. In The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys (eds). John Wiley, Chichester, 251-305.
15. KOURTZ, P. 1987. The Need for Improved Forest Fire Detection. The Forestry Chronicle, 272-277.
16. LABBÉ, M. AND G. LAPORTE. 1986. Maximizing User Convenience and Postal Service Efficiency in Post Box Location. Belgian J. Opns. Res. Statist, and Computer Sci. 26, 21-35.
17. LAPORTE, G. 1986. Generalized Sub tour Elimination Constraints and Connectivity Constraints. J. Opnl. Res. Soc. 37, 509-514.
18. LAPORTE, G. AND S. MARTELLO. 1990. The Selective Traveling Salesman Problem. Discrete Appl. Math. 26, 193-207.
19. NTAFOS, S. 1992. Watchman Routes under Limited Visibility. Computational Geometry, 1, 149-170.
20. OPPONG, J. R. AND M. J. HODGSON. 1994. Spatial Accessibility to Health Care Facilities in Suhum District, Ghana. Professional Geographer, 46, 199-209.
21. PADBERG, M. W. AND G. RINALDI. 1990. Facet Identification for the Symmetric Traveling Salesman Problem. Math. Programming, 47, 219-257.
22. REVELLE, C. S. AND G. LAPORTE. 1993. New Directions in Plant Location. Studies in Locational Analysis, 5, 31-58.