{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T20:26:19Z","timestamp":1768681579559,"version":"3.49.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,9,23]],"date-time":"2017-09-23T00:00:00Z","timestamp":1506124800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["POCI-01-0145-FEDER-016677"],"award-info":[{"award-number":["POCI-01-0145-FEDER-016677"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["UID\/CEC\/00319\/2013"],"award-info":[{"award-number":["UID\/CEC\/00319\/2013"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["SFRH\/BPD\/101134\/2014"],"award-info":[{"award-number":["SFRH\/BPD\/101134\/2014"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s10479-017-2647-4","type":"journal-article","created":{"date-parts":[[2017,9,23]],"date-time":"2017-09-23T15:52:41Z","timestamp":1506181961000},"page":"429-444","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Maximizing the expected number of transplants in kidney exchange programs with branch-and-price"],"prefix":"10.1007","volume":"272","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1851-4339","authenticated-orcid":false,"given":"Filipe","family":"Alvelos","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1085-0810","authenticated-orcid":false,"given":"Xenia","family":"Klimentova","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5932-5203","authenticated-orcid":false,"given":"Ana","family":"Viana","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,23]]},"reference":[{"issue":"1","key":"2647_CR1","first-page":"012011","volume":"616","author":"F Alvelos","year":"2015","unstructured":"Alvelos, F., Klimentova, X., Rais, A., & Viana, A. (2015). A compact formulation for maximizing the expected number of transplants in kidney exchange programs. Journal of Physics: Conference Series, 616(1), 012011.","journal-title":"Journal of Physics: Conference Series"},{"key":"2647_CR2","doi-asserted-by":"crossref","unstructured":"Alvelos, F., Klimentova, X., Rais, A., & Viana, A. (2016). Maximizing expected number of transplants in kidney exchange programs. In Electronic notes in discrete mathematics. INOC 2015\u20147th international network optimization conference, vol. 52, pp. 269\u2013276.","DOI":"10.1016\/j.endm.2016.03.036"},{"key":"2647_CR3","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1998","unstructured":"Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., & Vance, P. H. (1998). Branch-and-price: Column generation for solving huge integer programs. Operations Research, 46, 316\u2013329.","journal-title":"Operations Research"},{"issue":"1","key":"2647_CR4","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.ejor.2013.05.025","volume":"231","author":"M Constantino","year":"2013","unstructured":"Constantino, M., Klimentova, X., Viana, A., & Rais, A. (2013). New insights on integer-programming models for the kidney exchange problem. European Journal of Operational Research, 231(1), 57\u201368.","journal-title":"European Journal of Operational Research"},{"key":"2647_CR5","doi-asserted-by":"crossref","unstructured":"Dickerson, J., Procaccia, A. D., & Sandholm, T. (2013). Failure-aware kidney exchange. In EC-13: Proc. 14th ACM conference on electronic commerce, June.","DOI":"10.1145\/2492002.2482596"},{"key":"2647_CR6","doi-asserted-by":"crossref","unstructured":"Dickerson, J. P., Manlove, D. F., Plaut, B., Sandholm, T., & Trimble, J. (2016). Position-indexed formulations for kidney exchange. In Conference on economics and computation (EC).","DOI":"10.1145\/2940716.2940759"},{"key":"2647_CR7","unstructured":"ENCKEP. (2017). European network for collaboration on kidney exchange programmes. http:\/\/www.enckep-cost.eu\/ ."},{"key":"2647_CR8","unstructured":"Glorie, K. M., Carvalho, M., Bouman, P., Viana, A., & Constantino, M. (2014). Clearing barter exchange markets: Kidney exchange and beyond, Chapter VI. Ph.D. thesis, Erasmus University Rotterdam."},{"issue":"6","key":"2647_CR9","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1097\/TP.0b013e3182a132b7","volume":"96","author":"KM Glorie","year":"2013","unstructured":"Glorie, K. M., de Klerk, M., Wagelmans, A. P. M., van de Klundert, J. J., Zuidema, W. C., Claas, F. H. J., et al. (2013). Coordinating unspecified living kidney donation and transplantation across the blood-type barrier in kidney exchange. Transplantation Journal, 96(6), 814\u2013820.","journal-title":"Transplantation Journal"},{"issue":"4","key":"2647_CR10","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/msom.2014.0496","volume":"16","author":"KM Glorie","year":"2014","unstructured":"Glorie, K. M., van de Klundert, J. J., & Wagelmans, A. P. M. (2014). Kidney exchange with long chains: An efficient pricing algorithm for clearing barter exchanges with branch-and-price. Manufacturing & Service Operations Management (MSOM), 16(4), 498\u2013512.","journal-title":"Manufacturing & Service Operations Management (MSOM)"},{"key":"2647_CR11","doi-asserted-by":"crossref","unstructured":"Klimentova, X., Alvelos, F., & Ana Viana, A. (2014). A new branch-and-price approach for the kidney exchange problem. In B. M. S. Misra, A. M. A. R. C. Torre, J. G. R. M. I. Falc\u00e3o, D. T. B. O. Apduhan, & O. Gervasi (Eds.), Computational science and its applications\u2014ICCSA 2014, volume 8580 of Lecture Notes in Computer Science, pp. 237\u2013252. Springer International Publishing.","DOI":"10.1007\/978-3-319-09129-7_18"},{"key":"2647_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cor.2016.03.004","volume":"73","author":"X Klimentova","year":"2016","unstructured":"Klimentova, X., Pedroso, J. P., & Viana, A. (2016). Maximising expectation of the number of transplants in kidney exchange programmes. Computers & Operations Research, 73, 1\u201311.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"2647_CR13","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s12561-013-9082-0","volume":"6","author":"Y Li","year":"2014","unstructured":"Li, Y., Song, P. X., Zhou, Y., Leichtman, A., Rees, M., & Kalbfleisch, J. (2014). Optimal decisions for organ exchanges in a kidney paired donation program. Statistics in Biosciences, 6(1), 85\u2013104.","journal-title":"Statistics in Biosciences"},{"key":"2647_CR14","doi-asserted-by":"crossref","unstructured":"Mak-Hau, V. (2017). On the kidney exchange problem: Cardinality constrained cycle and chain problems on directed graphs: A survey of integer programming approaches. Journal of Combinatorial Optimization, 33(1), 35\u201359.","DOI":"10.1007\/s10878-015-9932-4"},{"key":"2647_CR15","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/978-3-642-30850-5_24","volume":"7276","author":"D Manlove","year":"2012","unstructured":"Manlove, D., & O\u2019Malley, G. (2012). Paired and altruistic kidney donation in the UK: Algorithms and experimentation. Lecture Notes in Computer Science, 7276, 271\u2013282.","journal-title":"Lecture Notes in Computer Science"},{"issue":"2","key":"2647_CR16","first-page":"2.6:1.1","volume":"19","author":"D Manlove","year":"2014","unstructured":"Manlove, D., & O\u2019Malley, G. (2014). Paired and altruistic kidney donation in the UK: Algorithms and experimentation. ACM Journal of Experimental Algorithmics, 19(2), 2.6:1.1\u20132.6:1.21.","journal-title":"ACM Journal of Experimental Algorithmics"},{"key":"2647_CR17","doi-asserted-by":"crossref","unstructured":"Pedroso, J. P. (2014). Maximizing expectation on vertex-disjoint cycle packing. In B. M. S. Misra, A. M. A. R. C. Torre, J. G. R. M. I. Falc\u00e3o, D. T. B. O. Apduhan & O. Gervasi (Eds.), Computational science and its applications\u2014ICCSA 2014, volume 8580 of Lecture Notes in Computer Science, pp. 32\u201346. Springer International Publishing.","DOI":"10.1007\/978-3-319-09129-7_3"},{"key":"2647_CR18","doi-asserted-by":"crossref","unstructured":"Plaut, B. Dickerson, J. P., & Sandholm, T. (2016). Fast optimal clearing of capped-chain barter exchanges. In AAAI conference on artificial intelligence (AAAI).","DOI":"10.1609\/aaai.v30i1.10053"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-017-2647-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2647-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2647-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T08:21:42Z","timestamp":1659514902000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-017-2647-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,23]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["2647"],"URL":"https:\/\/doi.org\/10.1007\/s10479-017-2647-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9,23]]}}}