Information Technology Reference
In-Depth Information
References
1. Abuhamdah, A.: Experimental result of late acceptance randomized descent algo-
rithm for solving course timetabling problems. International Journal of Computer
Science and Network Security 10(1), 192-200 (2010)
2. Angelelli, E., Mansini, R., Vindigni, M.: Look-ahead heuristics for the dynamic trav-
eling purchaser problem. Computers & Operations Research 38, 1867-1876 (2011)
3. Bellmore, M., Nemhauser, G.L.: The traveling salesman problem: A survey. Oper-
ations Research 16, 538-558 (1968)
4. Boctor, F., Laporte, G., Renaud, J.: Heuristics for the traveling purchaser problem.
Computers & Operations Research 30, 491-504 (2003)
5. Burke, E.K., Bykov, Y.: A late acceptance strategy in hill-climbing for exam
timetabling problems. In: Proceedings of the 7th Int. Conf. on the Practice and
Theory of Automated Timetabling, PATAT 2008 (2008)
6. Cambazard, H., Penz, B.: A constraint programming approach for the traveling
purchaser problem. In: Milano, M. (ed.) CP 2012. LNCS, vol. 7514, pp. 735-749.
Springer, Heidelberg (2012)
7. Goldbarg, M.C., Bagi, L.B., Goldbarg, E.F.G.: Transgenetic algorithm for the trav-
eling purchaser problem. European Journal of Operational Research 199, 36-45
(2009)
8. Golden, B., Levy, L., Dahl, R.: Two generalizations of the traveling salesman prob-
lem. Omega 9, 439-441 (1981)
9. Gouveia, L., Paias, A., Voß, S.: Models for a traveling purchaser problem with
additional side-constraints. Computers & Operations Research 38, 550-558 (2011)
10. Infante, D., Paletta, G., Vocaturo, F.: A ship-truck intermodal transportation prob-
lem. Maritime Economics & Logistics 11, 247-259 (2009)
11. Karg, R.L., Thompson, G.L.: A heuristic approach to solving travelling salesman
problems. Management Science 10, 225-248 (1964)
12. Laporte, G., Riera-Ledesma, J., Salazar-Gonzalez, J.: A branch-and-cut algorithm
for the undirected traveling purchaser problem. Operations Research 51, 940-951
(2003)
13. Ong, H.L.: Approximate algorithms for the travelling purchaser problem. Opera-
tions Research Letters 1, 201-205 (1982)
14. Ozcan, E., Bykov, Y., Birben, M., Burke, E.K.: Examination timetabling using
late acceptance hyper-heuristics. In: IEEE Congress on Evolutionary Computation,
CEC 2009, pp. 997-1004 (2009)
15. Ramesh, T.: Traveling purchaser problem. Opsearch 18, 78-91 (1981)
16. Riera-Ledesma, J., Salazar-Gonzalez, J.: A heuristic approach for the travelling
purchaser problem. European Journal of Operational Research 162, 142-152 (2005)
17. Riera-Ledesma, J., Salazar-Gonzalez, J.: Solving the asymmetric traveling pur-
chaser problem. Annals of Operations Research 144, 83-97 (2006)
18. Singh, K.N., van Oudheusden, D.L.: A branch and bound algorithm for the trav-
eling purchaser problem. European Journal of Operational Research 97, 571-579
(1997)
19. Teeninga, A., Volgenant, A.: Improved heuristics for the traveling purchaser prob-
lem. Computers & Operations Research 31, 139-150 (2004)
20. Verstichel, J., Berghe, G.: A late acceptance algorithm for the lock scheduling
problem. In: Voß, S., Pahl, J., Schwarze, S. (eds.) Logistik Management, pp. 457-
478. Physica, Heidelberg (2009)
21. Voß, S.: Dynamic tabu search strategies for the traveling purchaser problem. Annals
of Operations Research 63, 253-275 (1996)
