Abstract
In this chapter, we consider an example of multi-stage and bi-criteria optimization of matchings for a tree with five nodes [1, 2]. We also discuss the results of computational experiments with the algorithms A5, A6, and A8 for randomly generated trees and weight functions. We compare the number of matchings before and after optimization, compare the maximum cardinality of matchings before and after optimization relative to a randomly generated weight function, consider the number of POPs for bi-criteria optimization of matchings relative to the cardinality and a weight function, and study the existence of totally optimal matchings.
| Original language | English (US) |
|---|---|
| Title of host publication | Studies in Systems, Decision and Control |
| Publisher | Springer Science and Business Media Deutschland GmbH |
| Pages | 179-185 |
| Number of pages | 7 |
| 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)