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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of global optimization Ročník 57; číslo 2; s. 347 - 365
Hlavní autoři:	Lokman, Banu, Köksalan, Murat
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Boston Springer US 01.10.2013 Springer Springer Nature B.V
Témata:	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
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!