Cycle selections
From MaRDI portal
Publication:6041827
Recommendations
- On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches
- Maximum weight cycle packing in directed graphs, with application to kidney exchange programs
- Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange
- The cycle roommates problem: a hard case of kidney exchange
- Randomized parameterized algorithms for the kidney exchange problem
Cites work
- scientific article; zbMATH DE number 3156381 (Why is no real title available?)
- scientific article; zbMATH DE number 3728302 (Why is no real title available?)
- scientific article; zbMATH DE number 1517142 (Why is no real title available?)
- A branch and cut approach to the cardinality constrained circuit problem.
- A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs
- Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange
- Depth-First Search and Linear Graph Algorithms
- Digraphs
- Facets of the \(p\)-cycle polytope
- Integer Programming
- Kidney Exchange
- New insights on integer-programming models for the kidney exchange problem
- On cycle cones and polyhedra
- On the cycle polytope of a directed graph and its relaxations
- On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches
- Recourse in Kidney Exchange Programs
- Reducibility among combinatorial problems
- The Circuit Polytope: Facets
- The ellipsoid method and its consequences in combinatorial optimization
Cited in
(4)
This page was built for publication: Cycle selections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041827)
