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

Podrobná bibliografia

Vydané v:	Mathematical programming computation Ročník 8; číslo 2; s. 217 - 251
Hlavní autori:	Boland, Natashia, Charkhgard, Hadi, Savelsbergh, Martin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2016
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!