{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,21]],"date-time":"2026-06-21T08:54:02Z","timestamp":1782032042848,"version":"3.54.5"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,1,6]],"date-time":"2021-01-06T00:00:00Z","timestamp":1609891200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,6]],"date-time":"2021-01-06T00:00:00Z","timestamp":1609891200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100007224","name":"NAFOSTED","doi-asserted-by":"crossref","award":["102.01-2017.09"],"award-info":[{"award-number":["102.01-2017.09"]}],"id":[{"id":"10.13039\/100007224","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s10732-020-09464-8","type":"journal-article","created":{"date-parts":[[2021,1,6]],"date-time":"2021-01-06T10:08:55Z","timestamp":1609927735000},"page":"439-458","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A max-conflicts based heuristic search for the stable marriage problem with ties and incomplete lists"],"prefix":"10.1007","volume":"27","author":[{"given":"Hoang Huu","family":"Viet","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nguyen Thi","family":"Uyen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"SeungGwan","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"TaeChoong","family":"Chung","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Le Hong","family":"Trang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,1,6]]},"reference":[{"key":"9464_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, D.J., Irving, R.W., Manlove, D.F.: The student-project allocation problem. In: Proceedings of the 14th International Symposium, pp. 474\u2013484. Kyoto, Japan (2003)","DOI":"10.1007\/978-3-540-24587-2_49"},{"issue":"1","key":"9464_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2018.03.015","volume":"723","author":"D Adil","year":"2018","unstructured":"Adil, D., Gupta, S., Roy, S., Saurabh, S., Zehavi, M.: Parameterized algorithms for stable matching with ties and incomplete lists. Theoret. Comput. Sci. 723(1), 1\u201310 (2018)","journal-title":"Theoret. Comput. Sci."},{"key":"9464_CR3","doi-asserted-by":"crossref","unstructured":"Askalidis, G., Immorlica, N., Kwanashie, A., Manlove, D.F., Pountourakis, E.: Socially stable matchings in the hospitals\/residents problem. In: Proceedings of the 13th International Conference on Algorithms and Data Structures, pp. 85\u201396. London, ON, Canada (2013)","DOI":"10.1007\/978-3-642-40104-6_8"},{"issue":"1","key":"9464_CR4","doi-asserted-by":"publisher","first-page":"1410","DOI":"10.1007\/s00453-019-00650-0","volume":"82","author":"H Aziz","year":"2020","unstructured":"Aziz, H., Bir\u00f3, P., Gaspers, S., de Haan, R., Mattei, N., Rastegari, B.: Stable matching with uncertain linear preferences. Algorithmica 82(1), 1410\u20131433 (2020)","journal-title":"Algorithmica"},{"key":"9464_CR5","unstructured":"Bessi\u00e8re, C., R\u00e9gin, J.C.: Arc consistency for general constraint networks: preliminary results. In: Proceedings of IJCAI \u201997, pp. 398\u2013404. Morgan Kaufmann (1997)"},{"key":"9464_CR6","doi-asserted-by":"crossref","unstructured":"Codognet, P., Diaz, D.: Yet another local search method for constraint solving. In: Proceedings of the International Symposium on Stochastic Algorithms, pp. 73\u201390. Berlin, Germany (2001)","DOI":"10.1007\/3-540-45322-9_5"},{"issue":"1","key":"9464_CR7","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/s00224-017-9810-9","volume":"63","author":"A Cseha","year":"2019","unstructured":"Cseha, A., Irving, R.W., Manlove, D.F.: The stable roommates problem with short lists. Theory Comput. Syst. 63(1), 128\u2013149 (2019)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"9464_CR8","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.disopt.2016.03.002","volume":"20","author":"A Cseha","year":"2016","unstructured":"Cseha, A., Manlove, D.F.: Stable marriage and roommates problems with restricted edges: complexity and approximability. Discrete Optim. 20(1), 62\u201389 (2016)","journal-title":"Discrete Optim."},{"issue":"1","key":"9464_CR9","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1016\/j.ejor.2016.12.011","volume":"260","author":"F Diebold","year":"2017","unstructured":"Diebold, F., Bichler, M.: Matching with indifferences: a comparison of algorithms in the context of course allocation. Eur. J. Oper. Res. 260(1), 268\u2013282 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9464_CR10","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"9","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 9(1), 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"key":"9464_CR11","doi-asserted-by":"crossref","unstructured":"Gelain, M., Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Local search for stable marriage problems with ties and incomplete lists. In: Proceedings of 11th Pacific Rim International Conference on Artificial Intelligence, pp. 64\u201375. Daegu, Korea (2010)","DOI":"10.1007\/978-3-642-15246-7_9"},{"issue":"4","key":"9464_CR12","doi-asserted-by":"publisher","first-page":"591","DOI":"10.3390\/a6040591","volume":"6","author":"M Gelain","year":"2013","unstructured":"Gelain, M., Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Local search approaches in stable matching problems. Algorithms 6(4), 591\u2013617 (2013)","journal-title":"Algorithms"},{"key":"9464_CR13","doi-asserted-by":"crossref","unstructured":"Gent, I.P., Irving, R.W., Manlove, D., Prosser, P., Smith, B.M.: A constraint programming approach to the stable marriage problem. In: Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming, vol.\u00a01, pp. 225\u2013239. Berlin, Heidelberg (2001)","DOI":"10.1007\/3-540-45578-7_16"},{"key":"9464_CR14","unstructured":"Gent, I.P., Prosser, P.: An empirical study of the stable marriage problem with ties and incomplete lists. In: Proceedings of the 15th European Conference on Artificial Intelligence, pp. 141\u2013145. Lyon, France (2002)"},{"issue":"3","key":"9464_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1273340.1273346","volume":"3","author":"MM Halld\u00f3rsson","year":"2007","unstructured":"Halld\u00f3rsson, M.M., Iwama, K., Miyazaki, S.: Improved approximation results for the stable marriage problem. ACM Trans. Algorithms 3(3), 1\u201318 (2007)","journal-title":"ACM Trans. Algorithms"},{"key":"9464_CR16","doi-asserted-by":"crossref","unstructured":"Halld\u00f3rsson, M.M., Iwama, K., Miyazaki, S., Yanagisawa, H.: Improved approximation of the stable marriage problem. In: Proceedings of 11th Annual European Symposium on Algorithms, pp. 266\u2013277. Budapest, Hungary (2003)","DOI":"10.1007\/978-3-540-39658-1_26"},{"key":"9464_CR17","doi-asserted-by":"crossref","unstructured":"Halld\u00f3rsson, M.M., W.Irving, R., Iwama, K., F.Manlove, D., Miyazaki, S., Morita, Y., Scott, S.: Approximability results for stable marriage problems with ties. Theor. Comput. Sci. 306(1\u20133), 431\u2013447 (2003)","DOI":"10.1016\/S0304-3975(03)00321-9"},{"issue":"3","key":"9464_CR18","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0166-218X(92)00179-P","volume":"48","author":"RW Irving","year":"1994","unstructured":"Irving, R.W.: Stable marriage and indifference. Discrete Appl. Math. 48(3), 261\u2013272 (1994)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"9464_CR19","first-page":"1.2","volume":"14","author":"RW Irving","year":"2009","unstructured":"Irving, R.W., Manlove, D.F.: Finding large stable matchings. J. Exp. Algorithmics 14(2), 1.2\u20131.2:30 (2009)","journal-title":"J. Exp. Algorithmics"},{"issue":"1","key":"9464_CR20","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.jda.2008.09.003","volume":"7","author":"RW Irving","year":"2009","unstructured":"Irving, R.W., Manlove, D.F., O\u2019Malley, G.: Stable marriage with ties and bounded length preference lists. J. Discrete Algorithms 7(1), 213\u2013219 (2009)","journal-title":"J. Discrete Algorithms"},{"key":"9464_CR21","doi-asserted-by":"crossref","unstructured":"Iwama, K., Miyazaki, S.: A survey of the stable marriage problem and its variants. In: Proceedings of the International Conference on Informatics Education and Research for Knowledge-Circulating Society, pp. 131\u2013136. Washington, DC, USA (2008)","DOI":"10.1109\/ICKS.2008.7"},{"key":"9464_CR22","doi-asserted-by":"crossref","unstructured":"Iwama, K., Miyazaki, S., Morita, Y., Manlove, D.: Stable marriage with incomplete lists and ties. In: Proceedings of International Colloquium on Automata, Languages, and Programming, pp. 443\u2013452. Prague, Czech Republic (1999)","DOI":"10.1007\/3-540-48523-6_41"},{"key":"9464_CR23","doi-asserted-by":"crossref","unstructured":"Iwama, K., Miyazaki, S., Okamotoe, K.: A ($$2 - c{{log N} \\over {N}}$$)\u2014approximation algorithm for the stable marriage problem. In: Proceedings of the 9th Scandinavian Workshop on Algorithm Theory, pp. 349\u2013361. Humlebek, Denmark (2004)","DOI":"10.1007\/978-3-540-27810-8_30"},{"key":"9464_CR24","doi-asserted-by":"crossref","unstructured":"Iwama, K., Miyazaki, S., Yamauchi, N.: A ($$2 - c{{1} \\over {\\sqrt{N}}}$$)\u2014approximation algorithm for the stable marriage problem. In: Proceedings of the 16th international conference on Algorithms and Computation, pp. 902\u2013914. Sanya, Hainan, China (2005)","DOI":"10.1007\/11602613_90"},{"key":"9464_CR25","unstructured":"Iwama, K., Miyazaki, S., Yamauchi, N.: A 1.875: approximation algorithm for the stable marriage problem. In: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 288\u2013297. New Orleans, Louisiana (2007)"},{"issue":"1","key":"9464_CR26","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/s00453-007-9101-y","volume":"51","author":"K Iwama","year":"2008","unstructured":"Iwama, K., Miyazaki, S., Yamauchi, N.: A ($$2 - c{{1} \\over {\\sqrt{N}}}$$)\u2014approximation algorithm for the stable marriage problem. Algorithmica 51(1), 342\u2013356 (2008)","journal-title":"Algorithmica"},{"issue":"1","key":"9464_CR27","doi-asserted-by":"publisher","first-page":"471","DOI":"10.3390\/a6030471","volume":"6","author":"Z Kir\u00e1ly","year":"2013","unstructured":"Kir\u00e1ly, Z.: Linear time local approximation algorithm for maximum stable marriage. Algorithms 6(1), 471\u2013484 (2013)","journal-title":"Algorithms"},{"issue":"1\u20132","key":"9464_CR28","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0304-3975(01)00206-7","volume":"276","author":"DF Manlove","year":"2002","unstructured":"Manlove, D.F., Irving, R.W., Iwama, K., Miyazaki, S., Morita, Y.: Hard variants of stable marriage. Theoret. Comput. Sci. 276(1\u20132), 261\u2013279 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"9464_CR29","unstructured":"Manlove, D.F., O\u2019Malley, G.: Modelling and solving the stable marriage problem using constraint programming. In: Proceedings of the Fifth Workshop on Modelling and Solving Problems with Constraints, pp. 10\u201317. IJCAI\u201905 (2005)"},{"key":"9464_CR30","doi-asserted-by":"crossref","unstructured":"McDermid, E.: A 3\/2\u2014approximation algorithm for general stable marriage. In: Proceedings of the 36th International Colloquium on Automata, Languages, and Programming, pp. 689\u2013700. Rhodes, Greece (2009)","DOI":"10.1007\/978-3-642-02927-1_57"},{"key":"9464_CR31","unstructured":"Munera, D., Diaz, D., Abreu, S., Rossi, F., Saraswat, V., Codognet, P.: A local search algorithm for SMTI and its extension to HRT problems. In: Proceedings of the 3rd International Workshop on Matching Under Preferences, pp. 66\u201377. Glasgow, UK (2015)"},{"key":"9464_CR32","doi-asserted-by":"crossref","unstructured":"Munera, D., Diaz, D., Abreu, S., Rossi, F., Saraswat, V., Codognet, P.: Solving hard stable matching problems via local search and cooperative parallelization. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, pp. 1212\u20131218. Austin, Texas (2015)","DOI":"10.1609\/aaai.v29i1.9360"},{"key":"9464_CR33","doi-asserted-by":"crossref","unstructured":"Nakamura, M., Onaga, K., Kyan, S., Silva, M.: Genetic algorithm for sex-fair stable marriage problem. In: Circuits and Systems, 1995. ISCAS \u201995., 1995 IEEE International Symposium on, vol. 1, pp. 509\u2013512. Seattle, WA (1995)","DOI":"10.1109\/ISCAS.1995.521562"},{"key":"9464_CR34","doi-asserted-by":"crossref","unstructured":"Paluch, K.: Faster and simpler approximation of stable matchings. In: Proceedings of the 9th International Workshop on Approximation and Online Algorithms, pp. 176\u2013187. Saarbrucken, Germany (2011)","DOI":"10.1007\/978-3-642-29116-6_15"},{"issue":"2","key":"9464_CR35","doi-asserted-by":"publisher","first-page":"189","DOI":"10.3390\/a7020189","volume":"7","author":"K Paluch","year":"2014","unstructured":"Paluch, K.: Faster and simpler approximation of stable matchings. Algorithms 7(2), 189\u2013202 (2014)","journal-title":"Algorithms"},{"key":"9464_CR36","doi-asserted-by":"crossref","unstructured":"Viet, H.H., Trang, L.H., Lee, S.G., Chung, T.C.: An empirical local search for the stable marriage problem. In: Proceedings of the 14th Pacific Rim International Conference on Artificial Intelligence - PRICAI 2016: Trends in Artificial Intelligence, pp. 556\u2013564. Phuket, Thailand (2016)","DOI":"10.1007\/978-3-319-42911-3_46"},{"issue":"1","key":"9464_CR37","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1080\/0952813X.2019.1635655","volume":"32","author":"HH Viet","year":"2020","unstructured":"Viet, H.H., Trang, L.H., Tuyen, L.P., Chung, T.: A shortlist-based bidirectional local search for the stable marriage problem. J. Exp. Theor. Artif. Intell. 32(1), 147\u2013163 (2020)","journal-title":"J. Exp. Theor. Artif. Intell."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-020-09464-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-020-09464-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-020-09464-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,21]],"date-time":"2024-08-21T23:27:05Z","timestamp":1724282825000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-020-09464-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,6]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["9464"],"URL":"https:\/\/doi.org\/10.1007\/s10732-020-09464-8","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,6]]},"assertion":[{"value":"17 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 November 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}