Cycle selections
We introduce the following cycle selection problem which is motivated by an application to kidney exchange problems. Given a directed graph G=(V,A), a cycle selection is a subset of arcs B⊆A forming a union of directed cycles. A related optimization problem, the Maximum Weighted Cycle Selection prob...
Saved in:
| Published in: | Discrete Applied Mathematics 2023-08, Vol.335, p.4-24 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Subjects: | |
| Citations: | Items that this one cites |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|