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

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming computation Vol. 8; no. 2; pp. 217 - 251
Main Authors:	Boland, Natashia, Charkhgard, Hadi, Savelsbergh, Martin
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2016
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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