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

DOI10.1016/j.cor.2019.104852zbMath1458.90673OpenAlexW2985846866WikidataQ126812722 ScholiaQ126812722MaRDI QIDQ2289919

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

cyclecolumn generationseparationpricingfacetbranch-and-cut-and-pricekidney exchangesubtour

Mathematics Subject Classification ID

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

Related Items (4)

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

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches
• A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs
• Branching rules revisited
• New insights on integer-programming models for the kidney exchange problem
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Projection results for vehicle routing
• Vehicle Routing
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• An Integer Programming Approach to the Vehicle Scheduling Problem
• A polyhedral study of the asymmetric traveling salesman problem with time windows
• Finding All the Elementary Circuits of a Directed Graph
• MAXIMUM WEIGHT CYCLE PACKING IN DIRECTED GRAPHS, WITH APPLICATION TO KIDNEY EXCHANGE PROGRAMS
• Column Generation
• Selected Topics in Column Generation
• Improved Branch-Cut-and-Price for Capacitated Vehicle Routing
• Shortest Path Problems with Resource Constraints
• Experiments in mixed-integer linear programming
• Integer Programming and Combinatorial Optimization
• Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows

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