Branch-and-bound for biobjective mixed-integer linear programming
We present a generic branch-and-bound algorithm for finding the Pareto solutions of a biobjective mixed-integer linear program. The main contributions are new algorithms for obtaining dual bounds at a node, for checking node fathoming, presolve and duality gap measurement. Our branch-and-bound is predominantly a decision space search method since the branching is performed on the … Read more