On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches

DOI10.1007/s10878-015-9932-4zbMath1366.90180OpenAlexW1106295328MaRDI QIDQ512864

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

zbMATH Keywords

integer programminghealthcarecombinatorial optimizationkidney exchange

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27)

Related Items (7)

Randomized parameterized algorithms for the kidney exchange problem ⋮ A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs ⋮ Recourse in Kidney Exchange Programs ⋮ Cycle selections ⋮ Half-cycle: a new formulation for modelling kidney exchange problems ⋮ Novel integer programming models for the stable kidney exchange problem ⋮ Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange

Uses Software

• VRP

Cites Work

• Polyhedral study of the capacitated vehicle routing problem
• Models, relaxations and exact approaches for the capacitated vehicle routing problem
• On cardinality constrained cycle and path polytopes
• Exact algorithms for routing problems under vehicle capacity constraints
• The \(k\)-cardinality assignment problem
• The asymmetric traveling salesman problem with replenishment arcs
• The cardinality constrained covering traveling salesman problem
• New insights on integer-programming models for the kidney exchange 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
• Integer Programming Formulation of Traveling Salesman Problems
• Tabu Search and Ejection Chains—Application to a Node Weighted Version of the Cardinality-Constrained TSP
• Solving the Orienteering Problem through Branch-and-Cut
• MAXIMUM WEIGHT CYCLE PACKING IN DIRECTED GRAPHS, WITH APPLICATION TO KIDNEY EXCHANGE PROGRAMS
• Facets of the \(p\)-cycle polytope
• A branch and cut approach to the cardinality constrained circuit problem.

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