On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches
type: Item
instance of: scholarly article
title: On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches
zbMATH Open document ID: 1366.90180
author: Vicky Mak-Hau
published in: Journal of Combinatorial Optimization
publication date: 2017-03-03T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6691083
zbMATH Keywords: kidney exchange
zbMATH Keywords: integer programming
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: healthcare
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: s10878-015-9932-4
OpenAlex ID: W1106295328
cites work: The cardinality constrained covering traveling salesman problem
cites work: New insights on integer-programming models for the kidney exchange problem
cites work: Exact algorithms for routing problems under vehicle capacity constraints
cites work: A branch and cut approach to the cardinality constrained circuit problem.
cites work: MAXIMUM WEIGHT CYCLE PACKING IN DIRECTED GRAPHS, WITH APPLICATION TO KIDNEY EXCHANGE PROGRAMS
cites work: The asymmetric traveling salesman problem with replenishment arcs
cites work: Tabu Search and Ejection Chains—Application to a Node Weighted Version of the Cardinality-Constrained TSP
cites work: Models, relaxations and exact approaches for the capacitated vehicle routing problem
cites work: Polyhedral study of the capacitated vehicle routing problem
cites work: The \(k\)-cardinality assignment problem
cites work: Solving the Orienteering Problem through Branch-and-Cut
cites work: Facets of the \(p\)-cycle polytope
cites work: On cardinality constrained cycle and path polytopes
cites work: Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs
cites work: Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: On the Linear Description of the k-cycle Polytope
DOI: 10.1007/S10878-015-9932-4
description: scientific article; zbMATH DE number 6691083