A simple, efficient and versatile objective space algorithm for multiobjective integer programming

In the last years a multitude of algorithms have been proposed to solve multiobjective integer programming problems. However, only few authors offer open-source implementations. On the other hand, new methods are typically compared to code that is publicly available, even if this code is known to be...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Mathematical methods of operations research (Heidelberg, Germany) Jg. 100; H. 1; S. 351 - 384
Hauptverfasser:	Dächert, Kerstin, Fleuren, Tino, Klamroth, Kathrin
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin, Heidelberg Springer 01.08.2024 Springer Berlin Heidelberg Springer Nature B.V
Schlagworte:	Algorithms Business and Management Calculus of Variations and Optimal Control; Optimization Integer programming Local upper bounds Mathematics Mathematics and Statistics Multiobjective optimization Multiple objective analysis Nondominated set Objective space algorithms Operations Research/Decision Theory Original Article Scalarization Search region Source code Scalarization Search region Nondominated set Multiobjective optimization Objective space algorithms Local upper bounds
ISSN:	1432-5217, 1432-2994, 1432-5217
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!