Discussion of Matching Optimization Problem and Representation of Matchings

Michal Mankowski*, Mikhail Moshkov

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review


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 languageEnglish (US)
Title of host publicationStudies in Systems, Decision and Control
PublisherSpringer Science and Business Media Deutschland GmbH
Number of pages6
StatePublished - 2021

Publication series

NameStudies in Systems, Decision and Control
ISSN (Print)2198-4182
ISSN (Electronic)2198-4190

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)


Dive into the research topics of 'Discussion of Matching Optimization Problem and Representation of Matchings'. Together they form a unique fingerprint.

Cite this