{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T10:25:48Z","timestamp":1775471148954,"version":"3.50.1"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030420574","type":"print"},{"value":"9783030420581","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-42058-1_15","type":"book-chapter","created":{"date-parts":[[2020,3,3]],"date-time":"2020-03-03T12:03:51Z","timestamp":1583237031000},"page":"174-185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Weighted Stable Matching Algorithm as an Approximated Method for Assignment Problems"],"prefix":"10.1007","author":[{"given":"Duc Duong","family":"Lam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Van Tuan","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manh Ha","family":"Le","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manh Tiem","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quang Bang","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tran Su","family":"Le","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,4]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF02278710","volume":"38","author":"R Jonker","year":"1987","unstructured":"Jonker, R., Volgenant, A.: A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing 38, 325\u2013340 (1987)","journal-title":"Computing"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1287\/opre.47.3.449","volume":"47","author":"G Caron","year":"1999","unstructured":"Caron, G., Hansen, P.: The assignment problem with seniority and job priority constraints. Oper. Res. 47, 449\u2013453 (1999)","journal-title":"Oper. Res."},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0166-218X(97)00120-0","volume":"76","author":"M Dell\u2019Amico","year":"1997","unstructured":"Dell\u2019Amico, M., Martello, S.: The k-cardinality assignment problem. Discret. Appl. Math. 76, 103\u2013121 (1997)","journal-title":"Discret. Appl. Math."},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Monthly 69, 1 (1962)","journal-title":"Am. Math. Monthly"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6, 109\u2013133 (1995)","journal-title":"J. Glob. Optim."},{"key":"15_CR6","unstructured":"Naiem, A., El-Beltagy, M.: Deep greedy switching: a fast and simple approach for linear assignment problems. In: 7th International Conference of Numerical Analysis and Applied Mathematics (2009)"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1109\/LWC.2018.2843359","volume":"7","author":"M Lee","year":"2018","unstructured":"Lee, M., Xiong, Y., Yu, G., Li, G.Y.: Deep neural networks for linear sum assignment problems. IEEE Wirel. Commun. Lett. 7, 962\u2013965 (2018)","journal-title":"IEEE Wirel. Commun. Lett."},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"782","DOI":"10.3390\/a6040782","volume":"6","author":"MS Pini","year":"2013","unstructured":"Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Stability, optimality and manipulation in matching problems with weighted preferences. Algorithms 6, 782\u2013804 (2013)","journal-title":"Algorithms"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Amira, N., Giladi, R., Lotker, Z. Distributed weighted stable marriage problem. In: 17th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Sirince, Turkey (2010)","DOI":"10.1007\/978-3-642-13284-1_4"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1016\/j.econlet.2012.11.027","volume":"118","author":"JA Rodrigues-Neto","year":"2013","unstructured":"Rodrigues-Neto, J.A.: Acyclic roommates. Econ. Lett. 118, 304\u2013306 (2013)","journal-title":"Econ. Lett."},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1016\/j.jet.2005.02.013","volume":"135","author":"J Alvaro Rodrigues-Neto","year":"2007","unstructured":"Alvaro Rodrigues-Neto, J.: Representing roommates\u2019 preferences with symmetric utilities. J. Econ. Theory 135, 545\u2013550 (2007)","journal-title":"J. Econ. Theory"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s00182-016-0543-9","volume":"46","author":"J Park","year":"2017","unstructured":"Park, J.: Competitive equilibrium and singleton cores in generalized matching problems. Int. J. Game Theory 46, 487\u2013509 (2017)","journal-title":"Int. J. Game Theory"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1145\/362619.362631","volume":"14","author":"DG McVitie","year":"1971","unstructured":"McVitie, D.G., Wilson, L.B.: The stable marriage problem. Commun. ACM 14, 486\u2013490 (1971)","journal-title":"Commun. ACM"},{"issue":"4","key":"15_CR14","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1137\/0402048","volume":"2","author":"B Pittel","year":"1988","unstructured":"Pittel, B.: The average number of stable matchings. SIAM J. Discrete Math. 2(4), 530\u2013549 (1988)","journal-title":"SIAM J. Discrete Math."},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1086\/689869","volume":"125","author":"I Ashlagi","year":"2016","unstructured":"Ashlagi, I., Kanoria, Y., Leshno, J.D.: Unbalanced random matching markets: the stark effect of competition. J. Polit. Econ. 125, 69\u201398 (2016)","journal-title":"J. Polit. Econ."},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/rsa.3240010102","volume":"1","author":"DE Knuth","year":"1990","unstructured":"Knuth, D.E., Motwani, R., Pittel, B.: Stable husbands. Random Struct. Algorithms 1, 1\u201314 (1990)","journal-title":"Random Struct. Algorithms"},{"key":"15_CR17","first-page":"1","volume":"44","author":"B Pittel","year":"2018","unstructured":"Pittel, B.: On likely solutions of the stable matching problem with unequal numbers of men and women. Math. Oper. Res. 44, 1 (2018)","journal-title":"Math. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Intelligent Information and Database Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-42058-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,13]],"date-time":"2020-03-13T00:35:17Z","timestamp":1584059717000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-42058-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030420574","9783030420581"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-42058-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACIIDS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Conference on Intelligent Information and Database Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Phuket","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thailand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 March 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 March 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aciids2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aciids.pwr.edu.pl\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}