Maximizing expected number of transplants in kidney exchange programs

DOI10.1016/J.ENDM.2016.03.036MaRDI QIDQ325460zbMATH OpenOpenAlexFDO

Authors Filipe Alvelos, Xenia Klimentova, Abdur Rais, Ana Viana

Publication date 18 October 2016

Full work available at URL https://doi.org/10.1016/j.endm.2016.03.036

zbMATH Keywords

integer programmingbranch and priceexpected number of transplantskidney exchange problem

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Integer programming (90C10)

Recommendations

• Maximising expectation of the number of transplants in kidney exchange programmes
• New insights on integer-programming models for the kidney exchange problem
• Mathematics of kidney exchange programmes
• Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange
• Kidney exchange with immunosuppressants

Cites work

• Branch-and-price: Column generation for solving huge integer programs
• New insights on integer-programming models for the kidney exchange problem

Cited in

(13)

• Improved instance generation for kidney exchange programmes
• New insights on integer-programming models for the kidney exchange problem
• Maximising expectation of the number of transplants in kidney exchange programmes
• Maximum weight cycle packing in directed graphs, with application to kidney exchange programs
• Stochastic modelling and simulation of a kidney transplant waiting list
• Half-cycle: a new formulation for modelling kidney exchange problems
• Equilibrium Allocations Under Alternative Waitlist Designs: Evidence From Deceased Donor Kidneys
• New algorithms for hierarchical optimization in kidney exchange programs
• Mathematics of kidney exchange programmes
• A recourse policy to improve number of successful transplants in uncertain kidney exchange programs
• Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange
• Age-based preferences in paired kidney exchange
• On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches

This page was built for publication: Maximizing expected number of transplants in kidney exchange programs

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