New insights on integer-programming models for the kidney exchange problem

DOI10.1016/j.ejor.2013.05.025zbMath1317.90174OpenAlexW2117820474MaRDI QIDQ2356206

Abdur Rais, Xenia Klimentova, Ana Viana, Miguel Fragoso Constantino

Publication date: 29 July 2015

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10400.22/3315

zbMATH Keywords

integer programminghealthcarecombinatorial optimizationkidney exchange program

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Combinatorial optimization (90C27) Case-oriented studies in operations research (90B90) Matching models (91B68)

Related Items

Linearized formulations for failure aware barter exchange, Randomized parameterized algorithms for the kidney exchange problem, Maximizing expected number of transplants in kidney exchange programs, Maximising expectation of the number of transplants in kidney exchange programmes, A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs, Computing equilibria for integer programming games, Robust Models for the Kidney Exchange Problem, Improved instance generation for kidney exchange programmes, Cycle selections, Half-cycle: a new formulation for modelling kidney exchange problems, A recourse policy to improve number of successful transplants in uncertain kidney exchange programs, Novel integer programming models for the stable kidney exchange problem, Ignorance Is Almost Bliss: Near-Optimal Stochastic Matching with Few Queries, Nash equilibria in the two-player kidney exchange game, On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches, Kidney Exchange Programs with a Priori Crossmatch Probing, The \(k\)-regular induced subgraph problem, Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange, IP solutions for international kidney exchange programmes, A comparison of matching algorithms for kidney exchange programs addressing waiting time, A theoretical and computational equilibria analysis of a multi-player kidney exchange program

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Optimal Control of a Paired-Kidney Exchange Program
• Kidney Exchange
• Dynamic Kidney Exchange
• Symmetry in Integer Linear Programming
• MAXIMUM WEIGHT CYCLE PACKING IN DIRECTED GRAPHS, WITH APPLICATION TO KIDNEY EXCHANGE PROGRAMS
• Paths, Trees, and Flowers