A Simple and Efficient Algorithm For Solving Three Objective Integer Programs

@inproceedings{Boland2014ASA,
title={A Simple and Efficient Algorithm For Solving Three Objective Integer Programs},
author={Natashia Boland and Hadi Charkhgard and Martin Savelsbergh},
year={2014}
}

We present a new variant of the full (p − 1)-split algorithm, the Quadrant Shrinking Method, for finding all nondominated points of a triobjective integer program. The algorithm is easy to implement and solves at most 3|YN |+1 single-objective integer programs, where YN is the set of all nondominated points, when computing the entire nondominated frontier. A computational study demonstrates the efficacy of the proposed method.

Criterion space search algorithms for biobjective mixed integer programming part I: Integer programs. http://www.optimization-online. org/DB_FILE/2013/08/3987.pdf

N. Boland, H. Charkhgard, M. Savelsbergh

2013

1 Excerpt

Criterion space search algorithms for biobjective mixed integer programming part II: Mixed integer programs