Mathematics of kidney exchange programmes

MaRDI QIDQ5228219zbMATH OpenFDO

Authors Péter Biró

Publication date 9 August 2019

zbMATH Keywords

matchinginteger programmingcycle packingexchange problems

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Matching models (91B68)

Recommendations

• Algorithms for kidney donation
• The kidney exchange problem: how hard is it to find a donor?
• Kidney exchange: further utilization of donors via listed exchange
• Maximizing expected number of transplants in kidney exchange programs
• Kidney exchange with immunosuppressants

Cited in

(8)

• Pareto optimality in the kidney exchange Problem
• Untangling the Tuition Exchange program network
• A network model for minimizing the total organ transplant costs
• Maximizing expected number of transplants in kidney exchange programs
• The kidney exchange problem: how hard is it to find a donor?
• Maximising expectation of the number of transplants in kidney exchange programmes
• Algorithms for kidney donation
• New insights on integer-programming models for the kidney exchange problem

This page was built for publication: Mathematics of kidney exchange programmes

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