KidneyExchange.jl: a Julia package for solving the kidney exchange problem with branch-and-price
DOI10.1007/S12532-023-00251-7zbMATH Open1539.90002MaRDI QIDQ6548520FDOQ6548520
Authors: Ayşe N. Arslan, Jérémy Omer, Fulin Yan
Publication date: 1 June 2024
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Recommendations
- Robust Models for the Kidney Exchange Problem
- Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange
- New algorithms for hierarchical optimization in kidney exchange programs
- Recourse in Kidney Exchange Programs
- New insights on integer-programming models for the kidney exchange problem
Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Integer programming (90C10) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Matching models (91B68)
Cites Work
- Julia: a fresh approach to numerical computing
- JuMP: a modeling language for mathematical optimization
- Edge-disjoint spanning trees and depth-first search
- Kidney Exchange
- Accelerating strategies in column generation methods for vehicle routing and crew scheduling problems
- New insights on integer-programming models for the kidney exchange problem
- Integer programming formulations for the elementary shortest path problem
- Pairwise kidney exchange
- Parallelizing the dual revised simplex method
- A theoretical and computational equilibria analysis of a multi-player kidney exchange program
- On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches
- Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange
- Improved instance generation for kidney exchange programmes
- Recourse in Kidney Exchange Programs
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)