Bi-Criteria Optimization of Matchings

Michal Mankowski*, Mikhail Moshkov

*Corresponding author for this work

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


In this chapter, we describe an additional tool for the study of Pareto optimal points (POPs) in comparison to ones considered in Sect. 4.1 : the algorithm A7 for the fusion of sets of POPs [1]. We also propose the algorithm A8, which constructs the set of POPs for bi-criteria optimization of matchings in trees relative to two weight functions. In the end of the chapter, we discuss the notion of a totally optimal matching (optimal relative to two weight functions simultaneously) and show how we can recognize the existence of totally optimal matchings using multi-stage and bi-criteria optimization algorithms. This chapter contains some revised results from the conference paper [4].

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

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)


Dive into the research topics of 'Bi-Criteria Optimization of Matchings'. Together they form a unique fingerprint.

Cite this