摘要

We present a new exact approach for solving bi-objective integer linear programs. The new approach employs two of the existing exact algorithms in the literature, including the balanced box and the is an element of-constraint methods, in two stages. A computationally study shows that the new approach has three desirable characteristics. (1) It solves less single-objective integer linear programs. (2) Its solution time is significantly smaller. (3) It is competitive with the two-stage algorithm proposed by Leitner et al. (2016).

  • 出版日期2018-1