On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches
From MaRDI portal
Publication:512864
DOI10.1007/S10878-015-9932-4zbMATH Open1366.90180OpenAlexW1106295328MaRDI QIDQ512864FDOQ512864
Authors: Vicky Mak-Hau 
Publication date: 3 March 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9932-4
Recommendations
- Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange
- Maximizing expected number of transplants in kidney exchange programs
- New insights on integer-programming models for the kidney exchange problem
- Cycle selections
- Maximum weight cycle packing in directed graphs, with application to kidney exchange programs
Cites Work
- Integer Programming Formulation of Traveling Salesman Problems
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- Maximum weight cycle packing in directed graphs, with application to kidney exchange programs
- Exact algorithms for routing problems under vehicle capacity constraints
- Solving the Orienteering Problem through Branch-and-Cut
- The asymmetric traveling salesman problem with replenishment arcs
- New insights on integer-programming models for the kidney exchange problem
- A branch and cut approach to the cardinality constrained circuit problem.
- On cardinality constrained cycle and path polytopes
- Polyhedral study of the capacitated vehicle routing problem
- The \(k\)-cardinality assignment problem
- The cardinality constrained covering traveling salesman problem
- Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs
- Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs
- On the Linear Description of the k-cycle Polytope
- Tabu Search and Ejection Chains—Application to a Node Weighted Version of the Cardinality-Constrained TSP
- Facets of the \(p\)-cycle polytope
Cited In (10)
- Recourse in Kidney Exchange Programs
- Randomized parameterized algorithms for the kidney exchange problem
- A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs
- Maximum weight cycle packing in directed graphs, with application to kidney exchange programs
- Half-cycle: a new formulation for modelling kidney exchange problems
- Cycle selections
- Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange
- KidneyExchange.jl: a Julia package for solving the kidney exchange problem with branch-and-price
- Novel integer programming models for the stable kidney exchange problem
- New insights on integer-programming models for the kidney exchange problem
Uses Software
This page was built for publication: On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q512864)
