An Ant Colony Optimisation Algorithm for the Triple Matching Problem

[1] Karp R.M., Reducibility among combinatorial problems, [in:] R. Miller, J. Thatcher, Complexity of Computer Computations, Plenum, 1972, 85–103.10.1007/978-1-4684-2001-2_9Search in Google Scholar

[2] Knuth, D., Stable marriage and its relation to other combinatorial problems, An introduction to the mathematical analysis of algorithms, Amer. Math. Soc., Providence, RI, 1997.Search in Google Scholar

[3] Biro P., McDermid, E., Three-sided stable matching with cyclic preferences, Algorithmica 58(1), 2010, 5–18.10.1007/s00453-009-9315-2Search in Google Scholar

[4] Eriksson, K., Sjostrand, J., Strimling, P., Three-dimensional stable matching with cyclic preferences, Math. Soc. Sci. 52(1), 2006, 77–87.10.1016/j.mathsocsci.2006.03.005Search in Google Scholar

[5] Dorigo M., Stützle T., Ant colony optimization, Cambridge MIT Press. Proceedings of EvoWorkshops 2002, Berlin, Heidelberg, Springer-Verlag, 2002, 61–71.Search in Google Scholar

[6] Chen J., Iterative Expansion and Color Coding, an Improved Algorithm for 3D-Matching, ACM Transactions on Algorithms, 2012, 6.1–6.22.10.1145/2071379.2071385Search in Google Scholar

[7] Cao J., Chang W-L, Guo M., Using sticker to solve the 3-dimensional matching problem in molecular supercomputers, Int. J. High Performance Computing and Networking, Vol. 1, 2004, Nos. 1/2/3.10.1504/IJHPCN.2004.007572Search in Google Scholar

[8] Epifiano F.S., Ogasawara E., Soares J., Amorim M., Souza U., O Problema de Alocacao deTutores em Aplicacoes de Provas, XLVI Simposio Brasileiro de Pesquisa Operacional, Salvador, 16–19.09.2014 Brasil, 2014, 3007–3018.Search in Google Scholar