Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange

DOI10.1016/J.COR.2019.104852MaRDI QIDQ2289919zbMATH OpenOpenAlexWikidataFDO

Authors Edward Lam, Vicky Mak-Hau

Publication date 27 January 2020

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2019.104852

zbMATH Keywords

branch-and-cut-and-pricecolumn generationcyclefacetkidney exchangepricingseparationsubtour

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Applications of mathematical programming (90C90)

Recommendations

• On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches
• Maximizing expected number of transplants in kidney exchange programs
• New insights on integer-programming models for the kidney exchange problem
• Randomized parameterized algorithms for the kidney exchange problem
• Maximum weight cycle packing in directed graphs, with application to kidney exchange programs

Cites work

• A polyhedral study of the asymmetric traveling salesman problem with time windows
• A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs
• An Integer Programming Approach to the Vehicle Scheduling Problem
• Branching rules revisited
• Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows
• Column Generation
• Experiments in mixed-integer linear programming
• Finding All the Elementary Circuits of a Directed Graph
• scientific article; zbMATH DE number 1416629 (Why is no real title available?)
• Improved branch-cut-and-price for capacitated vehicle routing
• Integer Programming and Combinatorial Optimization
• Maximum weight cycle packing in directed graphs, with application to kidney exchange programs
• 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
• Projection results for vehicle routing
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Selected Topics in Column Generation
• Shortest Path Problems with Resource Constraints
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• The traveling salesman problem. A computational study.
• Vehicle Routing

Cited in

(12)

• Short trading cycles: paired kidney exchange with strict ordinal preferences
• New insights on integer-programming models for the kidney exchange problem
• Randomized parameterized algorithms for the kidney exchange problem
• Improved instance generation for kidney exchange programmes
• Maximizing expected number of transplants in kidney exchange programs
• On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches
• 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
• KidneyExchange.jl: a Julia package for solving the kidney exchange problem with branch-and-price
• Polyhedral approach to weighted connected matchings in general graphs
• Operational research approaches and mathematical models for kidney exchange: a literature survey and empirical evaluation

Describes a project that uses

Uses Software

• VRP

This page was built for publication: Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2289919)