![](bg5.png)
REFERENCES
Angel, R.D., Caudle, W.L., Noonan, R. and Whinston, A.,
1972. Computer assisted school bus scheduling.
Management Science 18: 279–88.
Applegate, D.L., Bixby, R.E., Chv´atal, V. and Cook,
W.J., 2003. Implementing the Dantzig–Fulkerson–
Johnson algorithm for large scale traveling salesman
problems. Math Program Ser B 97: 91–153.
Applegate, D. L., Bixby, R. E., Chvátal, V. and Cook, W.
J. 2006. The Traveling Salesman Problem: A
Computational Study, Princeton University Press,
ISBN 978-0-691-12993-8.
Balas, E., and Toth, P., 1985. Branch and bound methods.
The Traveling Salesman Problem: A Guided Tour of
Combinatorial Optimization, Wiley: Chichester: 361–
401.
Bland, R.E., and Shallcross, D.E., 1989. Large traveling
salesman problem arising from experiments in X-ray
crystallography: a preliminary report on computation.
Operations Research Letters 8(3): 125-128.
Basu, A., Elnagar, A., and Al-Hajj, A., 2000. Efficient
coordinated motion. Mathematical and Computer
Modelling, 31: 39–53.
Bektas, T., 2006. The multiple traveling salesman
problem: an overview of formulations and solution
procedures. OMEGA: The International Journal of
Management Science 34(3): 209-219.
Brummit, B., and Stentz, A., 1998. GRAMMPS: a
generalized mission planner for multiple mobile
robots. Proceedings of the IEEE international
conference on robotics and automation.
Calvo, R.W. and Cordone, R., 2003. A heuristic approach
to the overnight security service problem. Computers
and Operations Research 30: 1269–87.
Carpaneto, G., Dell’Amico, M. and Toth, P., 1995. Exact
solution of large-scale, asymmetric travelling salesman
problems. ACM Transactions on Mathematical
Software 21: 394–409.
Carter, A.E., and Ragsdale, C.T., 2002. Scheduling pre-
printed newspaper advertising inserts using genetic
algorithms. Omega 30: 415–21.
Christofides, N., Mingozzi, A., and Toth, P., 1981. Exact
algorithms for the vehicle routing problem, based on
spanning tree and shortest path relaxations.
Mathematical Programming 20: 255–82.
Dantzig, G.B., Fulkerson, D.R., and Johnson, S.M., 1954.
Solution of a large-scale traveling salesman problem.
Operations Research 2: 393–410.
Dell’Amico, M., and Toth, P., 2000. Algorithms and codes
for dense assignment problems: The state of the art.
Discrete Applied Mathematics 100(1-2): 17–48.
Fischetti, M., and Toth, P., 1992. An additive bounding
procedure for the asymmetric traveling salesman
problem. Mathematical Programming: Series A and B
53(2): 173–197.
Fischetti, M., Lancia, G., and Serafini, P. 2002. Exact
algorithms for minimum routing cost trees. Networks,
39(3): 161-173.
Gorenstein, S., 1970. Printing press scheduling for multi-
edition periodicals. Management Science 16(6): 373–
83.
Grötschel, M., and Holland O., 1991. Solution of Large-
scale Symmetric Traveling Salesman Problems.
Mathematical Programming 51: 141-202.
Kim, K.H., and Park, Y., 2004. A crane scheduling
method for port container terminals. European Journal
of Operational Research 156: 752–68.
Kulkarni, R.V., and Bhave, P.R., (1985). Integer
programming formulations of vehicle routing
problems. European Journal of Operational Research
20: 58–67.
Laporte, G., 1992. The vehicle routing problem: an
overview of exact and approximate algorithms.
European Journal of Operational Research 59: 345-
358.
Laporte, G., and Nobert. Y., 1980. A cutting planes
algorithm for the m-salesmen problem. Journal of the
Operational Research Society 31, 1017-1023.
Lenstra, J.K., and A.H.G. Rinnooy Kan., 1974. Some
Simple Applications of the Travelling Salesman
Problem. BW 38/74, Stichting Mathematisch Centrum,
Amsterdam.
Lenstra, J.K., and Rinnooy Kan, A.H.G., 1975. Some
simple applications of the traveling salesman problem.
Operational Research Quarterly 26:717–33.
Macharis, C., and Bontekoning, Y.M., 2004. Opportunities
for OR in intermodal freight transport research: a
review. European Journal of Operational Research
153: 400–16.
Miller, C., Tucker, A., and Zemlin, R., 1960. Integer
programming formulations and traveling salesman
problems. Journal of Association for Computing, 7:
326-329.
Mitrović-Minić, S., Krishnamurti, R., and Laporte, G.
2004. Double-horizon based heuristics for the dynamic
pickup and delivery problem with time windows.
Transportation Research 28(8): 669–85.
Mole, R.H., Johnson, D.G., and Wells, K., 1983.
Combinatorial analysis for route first-cluster second
vehicle routing. Omega 11(5), 507–12.
Orman, A.J., and Williams, H.P., 2006. A survey of
different integer programming formulations of the
travelling salesman problem. Springer: Berlin,
Heidelberg: 91–104.
O¨ncan, T., Altınel, I.K., and Laporte, G., 2009. A
comparative analysis of several asymmetric traveling
salesman problem formulations. Computers and
Operations Research 36: 637–654.
Padberg, M.W., and Hong, S., 1980. On the symmetric
travelling salesman problem: A computational study.
Mathematical Programming Study 12: 78–107.
Padberg, M.W., and Grötschel, M., 1985. Polyhedral
computations. The Traveling Salesman Problem: A
Guided Tour of Combinatorial Optimization. Wiley:
Chichester: 307–360.
Padberg, M., and Rinaldi, G., 1991. A branch-and-cut
algorithm for the resolution of largescale symmetric
traveling salesman problems. SIAM Review 33:60-100.
ICORES 2018 - 7th International Conference on Operations Research and Enterprise Systems
168