Maximising expectation of the number of transplants in kidney exchange programmes

DOI10.1016/j.cor.2016.03.004zbMath1349.91198OpenAlexW2298546028MaRDI QIDQ342402

Xenia Klimentova, Ana Viana, João Pedro Pedroso

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.03.004

zbMATH Keywords

cycle packingexpectation optimisationkidney exchange programmes

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80) Matching models (91B68)

Related Items (7)

Linearized formulations for failure aware barter exchange ⋮ A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs ⋮ Robust Models for the Kidney Exchange Problem ⋮ Recourse in Kidney Exchange Programs ⋮ Improved instance generation for kidney exchange programmes ⋮ A recourse policy to improve number of successful transplants in uncertain kidney exchange programs ⋮ Kidney Exchange Programs with a Priori Crossmatch Probing

Cites Work

• Unnamed Item
• Circular stable matching and 3-way kidney transplant
• New insights on integer-programming models for the kidney exchange problem
• Kidney Exchange
• MAXIMUM WEIGHT CYCLE PACKING IN DIRECTED GRAPHS, WITH APPLICATION TO KIDNEY EXCHANGE PROGRAMS

This page was built for publication: Maximising expectation of the number of transplants in kidney exchange programmes