Maximizing expected number of transplants in kidney exchange programs

DOI10.1016/j.endm.2016.03.036zbMath1351.90106OpenAlexW2397182086MaRDI QIDQ325460

Filipe Alvelos, Ana Viana, Xenia Klimentova, Abdur Rais

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

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

Cites Work

• New insights on integer-programming models for the kidney exchange problem
• Branch-and-Price: Column Generation for Solving Huge Integer Programs

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