We propose an exact algorithm for solving biobjective integer programming problems, which arise in various applications of operations research. The is based on Pascoletti-Serafini scalarizations to search specified regions (boxes) the objective space and returns set nondominated points. implement with different strategies, where choices scalarization model parameters splitting rule differ. then...

When analysing computer programs (especially numerical programs in which arrays are used extensively), one is often confronted with integer programming problems. These problems have three peculiarities: feasible points are ranked according to lexicographic order rather than the usual linear economic function; the feasible set depends on integer parameters; one is interested only in exact soluti...