KidneyExchange.jl: a Julia package for solving the kidney exchange problem with branch-and-price
From MaRDI portal
Publication:6548520
DOI10.1007/S12532-023-00251-7zbMATH Open1539.90002MaRDI QIDQ6548520
Jérémy Omer, Ayşe N. Arslan, Fulin Yan
Publication date: 1 June 2024
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Integer programming (90C10) Matching models (91B68) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Cites Work
- Integer programming formulations for the elementary shortest path problem
- On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches
- Pairwise kidney exchange
- Edge-disjoint spanning trees and depth-first search
- Parallelizing the dual revised simplex method
- A theoretical and computational equilibria analysis of a multi-player kidney exchange program
- Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange
- New insights on integer-programming models for the kidney exchange problem
- Improved instance generation for kidney exchange programmes
- Accelerating strategies in column generation methods for vehicle routing and crew scheduling problems
- Julia: A Fresh Approach to Numerical Computing
- Kidney Exchange
- Recourse in Kidney Exchange Programs
- JuMP: A Modeling Language for Mathematical Optimization
This page was built for publication: KidneyExchange.jl: a Julia package for solving the kidney exchange problem with branch-and-price
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6548520)
