Mathematics of kidney exchange programmes

MaRDI QIDQ5228219zbMATH OpenFDO

Authors Péter Biró

Publication date 9 August 2019

zbMATH Keywords

cycle packingexchange problemsinteger programmingmatching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) 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) 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)

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

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)