The L-shape search method for triobjective integer programming

We present a new criterion space search method, the L -shape search method, for finding all nondominated points of a triobjective integer program. The method is easy to implement, and is more efficient than existing methods. Moreover, it is intrinsically well-suited for producing high quality approx...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Mathematical programming computation Ročník 8; číslo 2; s. 217 - 251
Hlavní autoři: Boland, Natashia, Charkhgard, Hadi, Savelsbergh, Martin
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2016
Témata:
Full Length Paper
Mathematics
Mathematics and Statistics
Mathematics of Computing
Operations Research/Decision Theory
Optimization
Theory of Computation
90C29 (Multi-objective and goal programming)
90C10 (Integer programming)
ISSN:1867-2949, 1867-2957
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!
Popis
Shrnutí:We present a new criterion space search method, the L -shape search method, for finding all nondominated points of a triobjective integer program. The method is easy to implement, and is more efficient than existing methods. Moreover, it is intrinsically well-suited for producing high quality approximate nondominated frontiers early in the search process. An extensive computational study demonstrates its efficacy.
ISSN:1867-2949
1867-2957
DOI:10.1007/s12532-015-0093-3