Discrete/Binary Approach - Differential Evolution: A Topic for Global Permutation-Based Combinatorial Optimization - page 160

7. Fischetti, M., Salazar-Gonzalez, J., Toth, P.: The symmetrical generalized traveling salesman
polytope. Networks 26(2), 113-123 (1995)
8. Fischetti, M., Salazar-Gonzalez, J., Toth, P.: A branch-and-cut algorithm for the symmetric
generalized traveling salesman problem. Oper. Res. 45(3), 378-394 (1997)
9. Henry-Labordere, A.: The record balancing problem-A dynamic programming solution of
a generalized traveling salesman problem. Revue Francaise D Informatique DeRecherche
Operationnelle 3(NB2), 43-49 (1969)
10. Lampinen, J.: A Bibliography of Differential Evolution Algorithm, Technical Report,
Lappeenranta University of Technology, Department of Information Technology. Laboratory
of Information Processing (2000)
11. Laporte, G., Nobert, Y.: Generalized traveling salesman problem through n-sets of nodes -
An integer programming approach. INFOR 21(1), 61-75 (1983)
12. Laporte, G., Mercure, H., Nobert, Y.: Finding the shortest Hamiltonian circuit through n
clusters: A Lagrangian approach. Congressus Numerantium 48, 277-290 (1985)
13. Laporte, G., Mercure, H., Nobert, Y.: Generalized traveling salesman problem through n -
sets of nodes - The asymmetrical case. Discrete Appl. Math. 18(2), 185-197 (1987)
14. Laporte, G., Asef-Vaziri, A., Sriskandarajah, C.: Some applications of the generalized trav-
eling salesman problem. J. Oper. Res. Soc. 47(12), 461-1467 (1996)
15. Lien, Y., Ma, E., Wah, B.: Transformation of the Generalized Traveling Salesman Problem
into the Standard Traveling Salesman Problem. Information Science 64, 177-189 (1993)
16. Lin, S., Kernighan, B.: An effective heuristic algorithm for the traveling salesman problem.
Oper. Res. 21, 498-516 (1973)
17. Nawaz, M., Enscore, E., Ham, I.: Heuristic algorithm for the m-machine, n-job flow shop
sequencing problem. OMEGA 11(1), 91-95 (1983)
18. Noon, C.: The generalized traveling salesman problem, Ph.D. thesis. University of Michigan
(1988)
19. Noon, C., Bean, J.: A Lagrangian based approach for the asymmetric generalized traveling
salesman problem. Oper. Res. 39(4), 623-632 (1991)
20. Pan, Q.-K., Tasgetiren, M., Liang, Y.-C.: A Discrete differential evolution algorithm for the
permutation flowshop scheduling problem. Comput. Ind. Eng. (2008)
21. Pan, Q.-K., Tasgetiren, M., Liang, Y.-C.: A Discrete Particle Swarm Optimization Algorithm
for the No-Wait Flowshop Scheduling Problem with Makespan and Total Flowtime Criteria.
Comput. Oper. Res. 35, 2807-2839 (2008)
22. Price, K., Storn, R., Lapinen, J.: Differential Evolution - A Practical Approach to Global
Optimization. Springer, Heidelberg (2006)
23. Reinelt, G.: TSPLIB. A travelling salesman problem library. ORSA Journal on Computing 4,
134-143 (1996)
24. Renaud, J., Boctor, F.: An efficient composite heuristic for the symmetric generalized travel-
ing salesman problem. Eur. J. Oper. Res. 108(3), 571-584 (1998)
25. Renaud, J., Boctor, F., Laporte, G.: A fast composite heuristic for the symmetric traveling
salesman problem. INFORMS Journal on Computing 4, 134-143 (1996)
26. Rosenkrantz, D., Stearns, R., Lewis, P.: Approximate algorithms for the traveling salesman
problem. In: Proceedings of the 15th annual symposium of switching and automata theory,
pp. 33-42 (1974)
27. Ruiz, R., St utzle, T.: A simple and effective iterated greedy algorithm for the sequence flow-
shop scheduling problem. Eur. J. Oper. Res. 177(3), 2033-2049 (2007)
28. Saskena, J.: Mathematical model of scheduling clients through welfare agencies. Journal of
the Canadian Operational Research Society 8, 185-200 (1970)
29. Silberholz, J., Golden, B.: The generalized traveling salesman problem: A new genetic algo-
rithm approach. In: Edward, K.B., et al. (eds.) Extending the horizons: Advances in Com-
puting, Optimization and Decision Technologies, vol. 37, pp. 165-181. Springer, Heidelberg
(1997)