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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Mathematical methods of operations research (Heidelberg, Germany) Ročník 100; číslo 1; s. 351 - 384
Hlavní autoři:	Dächert, Kerstin, Fleuren, Tino, Klamroth, Kathrin
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin, Heidelberg Springer 01.08.2024 Springer Berlin Heidelberg Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!