.png){kind=icon}
.png){kind=icon}
Return
The Quadrant Shrinking Method: A simple and efficient algorithm for solving tri-objective integer programs
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2016.03.035.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 vertical bar Y-N vertical bar +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. (C) 2016 Elsevier B.V. All rights reserved.
Keywords:
Tri-objective integer programs
Quadrant shrinking method
Criterion space search method
Nondominated frontier
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W