In the present paper a bi-objective integer linear programming problem (BILP) is discussed. The main effort in this work is to effectively implement the ϵ-constraint method to produce a complete set ...

In this note we use the concept of intersection cut, introduced by Balas for integer programming problems, to develop a cutting-plane algorithm for solving integer interval linear programming problems ...