Maximising expectation of the number of transplants in kidney exchange programmes

DOI10.1016/J.COR.2016.03.004MaRDI QIDQ342402zbMATH OpenOpenAlexFDO

Authors Xenia Klimentova, João Pedro Pedroso, Ana Viana

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)

Recommendations

• Maximizing expected number of transplants in kidney exchange programs
• A recourse policy to improve number of successful transplants in uncertain kidney exchange programs
• Kidney exchange programs with a priori crossmatch probing
• Mathematics of kidney exchange programmes
• Mix and match: a strategyproof mechanism for multi-hospital kidney exchange
• Optimal control of a paired-kidney exchange program
• Transplant quality and patients' preferences in paired kidney exchange
• Free riding and participation in large scale, multi-hospital kidney exchange

Cites work

• Circular stable matching and 3-way kidney transplant
• Graph theory with applications
• Kidney Exchange
• Maximum weight cycle packing in directed graphs, with application to kidney exchange programs
• New insights on integer-programming models for the kidney exchange problem

Cited in

(12)

• Improved instance generation for kidney exchange programmes
• Robust Models for the Kidney Exchange Problem
• Recourse in Kidney Exchange Programs
• A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs
• Kidney exchange programs with a priori crossmatch probing
• Simulating the impact of crossover kidney transplantation on the Nord Italia transplant program
• New algorithms for hierarchical optimization in kidney exchange programs
• A recourse policy to improve number of successful transplants in uncertain kidney exchange programs
• Linearized formulations for failure aware barter exchange
• Maximizing expected number of transplants in kidney exchange programs
• Age-based preferences in paired kidney exchange
• Testing re-optimisation strategies in international kidney exchange programmes by the ENCKEP simulator

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342402)