References
- D. Gale, "The two-sided matching problem: origin, development and current issues," International Game Theory Review, vol. 3, no. 2-3, pp. 237-252, 2001. https://doi.org/10.1142/S0219198901000373
- D. F. Manlove and G. O'Malley, "Student-project allocation with preferences over projects," Journal of Discrete Algorithms, vol. 6, no. 4, pp. 553-560, 2008. https://doi.org/10.1016/j.jda.2008.07.003
- J. Wu, "Stable matching beyond bipartite graphs," in Proceedings of 2016 IEEE International Parallel and Distributed Processing Symposium Workshops, Chicago, IL, 2016, pp. 480-488.
- D. Gale and L. S. Shapley, "College admissions and the stability of marriage," The American Mathematical Monthly, vol. 69, no. 1, pp. 9-15, 1962. https://doi.org/10.1080/00029890.1962.11989827
- D. G. McVitie and L. B. Wilson, "The stable marriage problem," Communications of the ACM, vol. 14, no. 7, pp. 486-490, 1971. https://doi.org/10.1145/362619.362631
- R. W. Irving, P. Leather, and D. Gusfield, "An efficient algorithm for the "optimal" stable marriage," Journal of the ACM, vol. 34, no. 3, pp. 532-543, 1987. https://doi.org/10.1145/28869.28871
- I. Damianidis, "The stable marriage problem: optimizing different criteria using genetic algorithms," Master's thesis, University of Boras, Sweden, 2011
- K. Iwama and S. Miyazaki, "A survey of the stable marriage problem and its variants," in Proceedings of International Conference on Informatics Education and Research for Knowledge-Circulating Society, Kyoto, Japan, 2008, pp. 131-136.
- M. S. Pini, F. Rossi, B. Venable, and T. Walsh, "Stable marriage problems with quantitative preferencesm" 2010 [Online]. Available: https://arxiv.org/abs/1007.5120.
- M. Baiou and M. Balinski, "Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)," Discrete Applied Mathematics, vol. 101, no. 1-3, pp. 1-12, 2000. https://doi.org/10.1016/S0166-218X(99)00203-6
- I. Bello and S. Lianshuan, "Genetic algorithm for the stable marriage problem (SMP)," International Journal of Science and Research, vol. 5, no. 6, pp. 939-944, 2016.
- M. S. Pini, F. Rossi, K. B. Venable, and T. Walsh, "Stability, optimality and manipulation in matching problems with weighted preferences," Algorithms, vol. 6, no. 4, pp. 782-804, 2013. https://doi.org/10.3390/a6040782
- Membership option of BharatMatrimony [Online]. Available: http://www.bharatmatrimony.com/payments/paymentoptions.php
- A. L. Corcoran and R. L. Wainwright, "Using LibGA to develop genetic algorithms for solving combinatorial optimization problems," Practical Handbook of Genetic Algorithms. Boca Laton, FL: CRC Press, 1995, pp. 143-172.
- A. Banks, J. Vincent, and C. Anyakoha, "A review of particle swarm optimization. Part II: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications," Natural Computing, vol. 7, no. 1, pp. 109-124, 2008. https://doi.org/10.1007/s11047-007-9050-z
- Category:Stable sorts [Online]. Available: https://en.wikipedia.org/wiki/Category:Stable_sorts.