On the Connectedness of Efficient Solutions in Combinatorial Optimization Problems and Ordered Graphs - Matching and Partial Orders -

  • In multicriteria optimization problems the connectedness of the set of efficient solutions (pareto set) is of special interest since it would allow the determination of the efficient solutions without considering non-efficient solutions in the process. In the case of the multicriteria problem to minimize matchings the set of efficient solutions is not connected. The set of minimal solutions E pot with respect to the power ordered set contains the pareto set. In this work theorems about connectedness of E pot are given. These lead to an automated process to detect all efficient solutions.

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Ulrike Bossong
URN (permanent link):urn:nbn:de:hbz:386-kluedo-10774
Serie (Series number):Report in Wirtschaftsmathematik (WIMA Report) (65)
Document Type:Preprint
Language of publication:English
Year of Completion:2000
Year of Publication:2000
Publishing Institute:Technische Universität Kaiserslautern
Faculties / Organisational entities:Fachbereich Mathematik
DDC-Cassification:510 Mathematik

$Rev: 12793 $