The biobjective minimum‐cost perfect matching problem and Chinese postman problem

In this paper, we address the biobjective versions of the perfect matching problem (PMP) and the Chinese postman problem (CPP). Both problems are solved by means of integer formulations or separating blossom inequalities, exploiting the PMP relationship with the CPP. In both cases, we first find the...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	International transactions in operational research 2024-09, Vol.31 (5), p.2988-3009
Hauptverfasser:	Pozo, Miguel A., Puerto, Justo, Roldán, Ignacio
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes biobjective optimization Combinatorial analysis CPP Graph theory Integers Matching Pareto front PMP
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!