Recourse in Kidney Exchange Programs
From MaRDI portal
Publication:5086017
DOI10.1287/IJOC.2021.1099OpenAlexW2940481310MaRDI QIDQ5086017FDOQ5086017
Authors: Bart Smeulders, Valentin Bartier, Frits C. R. Spieksma, Yves Crama 
Publication date: 30 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://orbi.uliege.be/handle/2268/231958
Recommendations
- Robust Models for the Kidney Exchange Problem
- Maximizing expected number of transplants in kidney exchange programs
- Kidney exchange programs with a priori crossmatch probing
- Maximising expectation of the number of transplants in kidney exchange programmes
- New insights on integer-programming models for the kidney exchange problem
Management decision making, including multiple objectives (90B50) Stochastic programming (90C15) Integer programming (90C10)
Cites Work
- The sample average approximation method for stochastic discrete optimization
- Kidney Exchange
- Maximising expectation of the number of transplants in kidney exchange programmes
- On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches
- The Benders decomposition algorithm: a literature review
- Stochastic Matching with Few Queries: New Algorithms and Tools
Cited In (6)
- New algorithms for hierarchical optimization in kidney exchange programs
- Cycle selections
- Performance evaluation of national and international kidney exchange programmes with the ENCKEP simulator
- Testing re-optimisation strategies in international kidney exchange programmes by the ENCKEP simulator
- Conflicting objectives in kidney exchange
- KidneyExchange.jl: a Julia package for solving the kidney exchange problem with branch-and-price
This page was built for publication: Recourse in Kidney Exchange Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5086017)
