Improved instance generation for kidney exchange programmes
From MaRDI portal
Publication:2669768
Recommendations
- Algorithms for kidney donation
- New insights on integer-programming models for the kidney exchange problem
- Kidney exchange programs with a priori crossmatch probing
- Maximizing expected number of transplants in kidney exchange programs
- Maximising expectation of the number of transplants in kidney exchange programmes
Cites work
- Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- Kidney Exchange
- Maximising expectation of the number of transplants in kidney exchange programmes
- New insights on integer-programming models for the kidney exchange problem
- Paths, Trees, and Flowers
Cited in
(10)- Half-cycle: a new formulation for modelling kidney exchange problems
- Rejection-proof mechanisms for multi-agent kidney exchange
- KidneyExchange.jl: a Julia package for solving the kidney exchange problem with branch-and-price
- Penalties and rewards for fair learning in paired kidney exchange programs
- Performance evaluation of national and international kidney exchange programmes with the ENCKEP simulator
- Designing a kidney exchange program in Germany: simulations and recommendations
- Adaptation, comparison and practical implementation of fairness schemes in kidney exchange programs
- Maximum-expectation matching under recourse
- Operational research approaches and mathematical models for kidney exchange: a literature survey and empirical evaluation
- Computing balanced solutions for large international kidney exchange schemes when cycle length is unbounded
This page was built for publication: Improved instance generation for kidney exchange programmes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669768)