We present a new variant of the full 2-split algorithm, the Quadrant Shrinking Method (QSM), for finding all nondominated points of a tri-objective integer program. The algorithm is easy to implement and solves at most 3 | Y N | + 1 single-objective integer programs when computing the nondominated frontier, where Y N is the set of all nondominated points. A computational study demonstrates the efficacy of QSM. 
The Quadrant Shrinking Method: A simple and efficient algorithm for solving tri-objective integer programs