1. Agrawal, S., Wang, Z., Ye, Y.: Parimutuel betting on permutations. In: Internet and Network Economics. Lecture Notes in Computer Science, vol. 5385, pp. 126–137. Springer, Berlin (2008)
2. Bean C.J.: Genetic algorithms and random keys for sequencing and optimization. INFORMS J. Comput. 6(2), 154–160 (1994)
3. Bengoetxea E., Larrañaga P., Bloch I., Perchant A., Boeres C.: Inexact graph matching by means of estimation of distribution algorithms. Pattern Recognit. 35(12), 2867–2880 (2002)
4. Bosman P.A.N., Thierens D.: Expanding from discrete to continuous estimation of distribution algorithms: the IDEA. In: Schoenauer, M., Deb, K., Rudolph, G., Yao, X., Lutton, E., Guervós, J.J.M., Schwefel, H.P (eds) PPSN. Lecture Notes in Computer Science vol. 1917., pp. 767–776. Springer, Berlin (2000)
5. Bosman P.A.N., Thierens D. et al.: Crossing the road to efficient IDEAs for permutation problems. In: Spector, L. (eds) Genetic and Evolutionary Computation Conference, GECCO 2001, Proceedings, San Francisco, California, USA, 2001., pp. 219–226. Morgan Kaufmann, Massachusetts (2001)