Abstract
In this chapter, we discuss the problem of optimization of matchings in trees including its relation to the kidney paired donation. We did not find a conventional circuit without repetitions that represents the set of all matchings for an arbitrary tree. Instead of a circuit, we construct a labeled forest to describe the set of matchings [7]. We use this forest in multi-stage and bi-criteria optimization and counting matchings.
| Original language | English (US) |
|---|---|
| Title of host publication | Studies in Systems, Decision and Control |
| Publisher | Springer Science and Business Media Deutschland GmbH |
| Pages | 159-164 |
| Number of pages | 6 |
| DOIs | |
| State | Published - 2021 |
Publication series
| Name | Studies in Systems, Decision and Control |
|---|---|
| Volume | 331 |
| ISSN (Print) | 2198-4182 |
| ISSN (Electronic) | 2198-4190 |
Bibliographical note
Publisher Copyright:© The Author(s), under exclusive license to Springer Nature Switzerland AG 2021.
ASJC Scopus subject areas
- Computer Science (miscellaneous)
- Control and Systems Engineering
- Automotive Engineering
- Social Sciences (miscellaneous)
- Economics, Econometrics and Finance (miscellaneous)
- Control and Optimization
- Decision Sciences (miscellaneous)