A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs
From MaRDI portal
Publication:1654342
DOI10.1016/j.cor.2018.06.008zbMath1458.90615OpenAlexW2808219207MaRDI QIDQ1654342
Publication date: 8 August 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.06.008
integer programmingcombinatorial optimisationkidney exchangepolyhedral analysiscardinality constrained cycle and chainsclearing barter exchange
Related Items (4)
Randomized parameterized algorithms for the kidney exchange problem ⋮ Cycle selections ⋮ A recourse policy to improve number of successful transplants in uncertain kidney exchange programs ⋮ Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange
Uses Software
Cites Work
- Maximising expectation of the number of transplants in kidney exchange programmes
- On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches
- Polyhedral study of the capacitated vehicle routing problem
- PANDA: a software for polyhedral transformations
- The cardinality constrained covering traveling salesman problem
- New insights on integer-programming models for the kidney exchange problem
- Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs
- New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP
- Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem
- Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs
- On the Linear Description of the k-cycle Polytope
- Integer Programming Formulation of Traveling Salesman Problems
- The Black and White Traveling Salesman Problem
- Facets of the Asymmetric Traveling Salesman Polytope
- A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- The prize collecting traveling salesman problem: II. Polyhedral results
- MAXIMUM WEIGHT CYCLE PACKING IN DIRECTED GRAPHS, WITH APPLICATION TO KIDNEY EXCHANGE PROGRAMS
- The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph
- Facets of the \(p\)-cycle polytope
- A branch and cut approach to the cardinality constrained circuit problem.
This page was built for publication: A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs
