References
- Biro, P. and McDemid, E. (2010) Three-sided stable matching with cyclic preferences. Algorithmica, 58, 1, 5-18.10.1007/s00453-009-9315-2
- Chen, J. (2012) Iterative expansion and Color Coding: an Improved Algorithm for 3D-Matching. ACM Transactions on Algorithms, 6.1-6.22.10.1145/2071379.2071385
- Dorigo, M., Di Caro, G. and Gambardella, L. M. (1999) Ant algorithms for discrete optimization. Artificial Life, 5, 2, 137–172.10.1162/10645469956872810633574
- Eriksson, K., Sjöstrand, J. and Strimling, P. (2006) Three-dimensional stable matching with cyclic preferences. Mathematical Social Sciences, 52, 1, 77-87.10.1016/j.mathsocsci.2006.03.005
- Karp, R.M. (1972) Reducibility among Combinatorial Problems. In: R. E. Miller and J. W. Thatcher, eds., Complexity of Computer Computation. Plenum Press, N.Y., 85-103.10.1007/978-1-4684-2001-2_9
- Knuth, D. (1997) Stable marriage and its relation to other combinatorial problems: An introduction to the mathematical analysis of algorithms. Amer. Math. Soc., Providence, RI.
- Schiff, K. (2018) An ant algorithmfor the triple matching problem. Technical Transactions, Electrical Engineering, 115, 2, 179-186.
- Schiff, K. (2020) An improved ant algorithm for the triple matching problem. Technical Transactions, 13, 1, art no. 20200005, 1-7.10.37705/TechTrans/e2020005