Author:
Chisca Danuta Sorina,Lombardi Michele,Milano Michela,O’Sullivan Barry
Publisher
Springer International Publishing
Reference31 articles.
1. Abraham, D.J., Blum, A., Sandholm, T.: Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges. In: Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), San Diego, California, USA, pp. 295–304, 11–15 June 2007.
https://doi.org/10.1145/1250910.1250954
2. Alvelos, F., Klimentova, X., Rais, A., Viana, A.: A compact formulation for maximizing the expected number of transplants in kidney exchange programs. J. Phys.: Conf. Ser. 616, 012011 (2015)
3. Anderson, R., Ashlagi, I., Gamarnik, D., Roth, A.E.: Finding long chains in kidney exchange using the traveling salesman problem. Proc. Nat. Acad. Sci. 112(3), 663–668 (2015)
4. Ashlagi, I., Roth, A.E.: New challenges in multihospital kidney exchange. Am. Econ. Rev. 102(3), 354–359 (2012).
https://doi.org/10.1257/aer.102.3.354
5. Bofill, M., Busquets, D., Muñoz, V., Villaret, M.: Reformulation based maxsat robustness. Constraints 18(2), 202–235 (2013).
https://doi.org/10.1007/s10601-012-9130-2
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献