A comparison of matching algorithms for kidney exchange programs addressing waiting time

DOI10.1007/s10100-020-00680-yOpenAlexW3013679246MaRDI QIDQ2045619

Xenia Klimentova, Ana Viana, João Pedro Pedroso, Tiago Monteiro

Publication date: 13 August 2021

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-020-00680-y

zbMATH Keywords

simulationgreedy algorithmwaiting timekidney exchange programs

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (2)

Operations research in Hungary: VOCAL 2018 ⋮ Or in the industrial engineering of industry 4.0: experiences from the Iberian Peninsula mirrored in CJOR

Uses Software

• Gurobi

Cites Work

• New insights on integer-programming models for the kidney exchange problem
• Dynamic Kidney Exchange
• Efficient Dynamic Barter Exchange
• Paths, Trees, and Flowers

This page was built for publication: A comparison of matching algorithms for kidney exchange programs addressing waiting time