A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs
type: Item
instance of: scholarly article
title: A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs
zbMATH Open document ID: 1458.90615
author: Vicky Mak-Hau
published in: Computers \& Operations Research
publication date: 2018-08-08T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6914684
zbMATH Keywords: integer programming
zbMATH Keywords: combinatorial optimisation
zbMATH Keywords: polyhedral analysis
zbMATH Keywords: cardinality constrained cycle and chains
zbMATH Keywords: kidney exchange
zbMATH Keywords: clearing barter exchange
describes a project that uses: PANDA
MaRDI profile type: Publication
full work available at URL: j.cor.2018.06.008
OpenAlex ID: W2808219207
cites work: A polyhedral study of the asymmetric traveling salesman problem with time windows
cites work: The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph
cites work: The prize collecting traveling salesman problem: II. Polyhedral results
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: New insights on integer-programming models for the kidney exchange problem
cites work: Polyhedral study of the capacitated vehicle routing problem
cites work: Facets of the Asymmetric Traveling Salesman Polytope
cites work: A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
cites work: The Black and White Traveling Salesman Problem
cites work: Facets of the \(p\)-cycle polytope
cites work: Maximising expectation of the number of transplants in kidney exchange programmes
cites work: PANDA: a software for polyhedral transformations
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: New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP
cites work: Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem
cites work: On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: On the Linear Description of the k-cycle Polytope
cites work: The cardinality constrained covering traveling salesman problem
DOI: 10.1016/J.COR.2018.06.008
description: scientific article; zbMATH DE number 6914684