KidneyExchange.jl: a Julia package for solving the kidney exchange problem with branch-and-price
From MaRDI portal
Publication:6548520
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
Cites work
- A theoretical and computational equilibria analysis of a multi-player kidney exchange program
- Accelerating strategies in column generation methods for vehicle routing and crew scheduling problems
- Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange
- Edge-disjoint spanning trees and depth-first search
- Improved instance generation for kidney exchange programmes
- Integer programming formulations for the elementary shortest path problem
- JuMP: a modeling language for mathematical optimization
- Julia: a fresh approach to numerical computing
- Kidney Exchange
- New insights on integer-programming models for the kidney exchange problem
- On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches
- Pairwise kidney exchange
- Parallelizing the dual revised simplex method
- 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)