Finding all nondominated points of multi-objective integer programs

We develop exact algorithms for multi-objective integer programming (MIP) problems. The algorithms iteratively generate nondominated points and exclude the regions that are dominated by the previously-generated nondominated points. One algorithm generates new points by solving models with additional...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of global optimization Jg. 57; H. 2; S. 347 - 365
Hauptverfasser:	Lokman, Banu, Köksalan, Murat
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Boston Springer US 01.10.2013 Springer Springer Nature B.V
Schlagworte:	Algorithms Computer Science Decision making Experiments Graph theory Industrial engineering Integer programming Linear programming Mathematical analysis Mathematical models Mathematics Mathematics and Statistics Methods Objectives Operations research Operations Research/Decision Theory Optimization Real Functions Searching Shortest-path problems Nondominated point Combinatorial optimization Multiple criteria
ISSN:	0925-5001, 1573-2916
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!