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-4MaRDI QIDQ512864zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

combinatorial optimizationinteger programminghealthcarekidney exchange

Mathematics Subject Classification ID

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

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

• A branch and cut approach to the cardinality constrained circuit problem.
• Exact algorithms for routing problems under vehicle capacity constraints
• Facets of the \(p\)-cycle polytope
• Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs
• Integer Programming Formulation of Traveling Salesman Problems
• Maximum weight cycle packing in directed graphs, with application to kidney exchange programs
• Models, relaxations and exact approaches for the capacitated vehicle routing problem
• New insights on integer-programming models for the kidney exchange problem
• On cardinality constrained cycle and path polytopes
• On the Linear Description of the k-cycle Polytope
• Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs
• Polyhedral study of the capacitated vehicle routing problem
• Solving the Orienteering Problem through Branch-and-Cut
• Tabu Search and Ejection Chains—Application to a Node Weighted Version of the Cardinality-Constrained TSP
• The \(k\)-cardinality assignment problem
• The asymmetric traveling salesman problem with replenishment arcs
• The cardinality constrained covering traveling salesman problem

Cited in

(10)

• Novel integer programming models for the stable kidney exchange problem
• 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
• Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange
• Cycle selections
• KidneyExchange.jl: a Julia package for solving the kidney exchange problem with branch-and-price
• New insights on integer-programming models for the kidney exchange problem

Describes a project that uses

Uses Software

• VRP

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)