On Complete and Quasi-Complete Two-Criteria Optimization Problems on Graphs

Sufficient conditions are studied for the presence of the completeness or quasicompleteness property in two-criteria discrete optimization problems with the same and different weight-type criteria. Estimates are computed for the cardinalities of sets of feasible solutions, the Pareto set, and a comp...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Cybernetics and systems analysis 2018-05, Vol.54 (3), p.385-390
Hauptverfasser: Perepelitsa, V. A., Tereschenko, E. V.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Sufficient conditions are studied for the presence of the completeness or quasicompleteness property in two-criteria discrete optimization problems with the same and different weight-type criteria. Estimates are computed for the cardinalities of sets of feasible solutions, the Pareto set, and a complete set of alternatives for a number of two-criteria problems.
ISSN:1060-0396
1573-8337
DOI:10.1007/s10559-018-0040-1