Bi-Criteria Optimization of Matchings

Michal Mankowski; Mikhail Moshkov

doi:10.1007/978-3-030-63920-4_16

Bi-Criteria Optimization of Matchings

Michal Mankowski^*, Mikhail Moshkov

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Abstract

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 A₇ for the fusion of sets of POPs [1]. We also propose the algorithm A₈, 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 language	English (US)
Title of host publication	Studies in Systems, Decision and Control
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	173-178
Number of pages	6
DOIs	https://doi.org/10.1007/978-3-030-63920-4_16
State	Published - 2021

Publication series

Name	Studies in Systems, Decision and Control
Volume	331
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)

Access to Document

10.1007/978-3-030-63920-4_16

Cite this

@inbook{b3ea38a00d0346f18b00637fc89bf4e0,

title = "Bi-Criteria Optimization of Matchings",

abstract = "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].",

author = "Michal Mankowski and Mikhail Moshkov",

note = "Publisher Copyright: {\textcopyright} The Author(s), under exclusive license to Springer Nature Switzerland AG 2021.",

year = "2021",

doi = "10.1007/978-3-030-63920-4_16",

language = "English (US)",

series = "Studies in Systems, Decision and Control",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "173--178",

booktitle = "Studies in Systems, Decision and Control",

address = "Germany",

}

TY - CHAP

T1 - Bi-Criteria Optimization of Matchings

AU - Mankowski, Michal

AU - Moshkov, Mikhail

PY - 2021

Y1 - 2021

N2 - 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].

AB - 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].

UR - http://www.scopus.com/inward/record.url?scp=85101415498&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-63920-4_16

DO - 10.1007/978-3-030-63920-4_16

M3 - Chapter

AN - SCOPUS:85101415498

T3 - Studies in Systems, Decision and Control

SP - 173

EP - 178

BT - Studies in Systems, Decision and Control

PB - Springer Science and Business Media Deutschland GmbH

ER -

Bi-Criteria Optimization of Matchings

Abstract

Publication series

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this