Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems

Multi-objective integer or mixed-integer programming problems typically have disconnected feasible domains, making the task of constructing an approximation of the Pareto front challenging. The present article shows that certain algorithms that were originally devised for continuous problems can be...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Engineering optimization Jg. 54; H. 8; S. 1413 - 1425
Hauptverfasser:	Burachik, Regina S., Kaya, C. Yalçın, Rizvi, Mohammed Mustafa
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Abingdon Taylor & Francis 03.08.2022 Taylor & Francis Ltd
Schlagworte:	Algorithms Integer programming Mixed integer mixed-integer programming Multi-objective optimization numerical methods Pareto front scalarization
ISSN:	0305-215X, 1029-0273
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!