Constraint propagation using dominance in interval Branch & Bound for nonlinear biobjective optimization

In this paper, we present an interval Branch & Bound algorithm which integrates dominance contractors, constraint propagation mechanisms that exploit an upper bound set using dominance relations. This method discards from the decision space values yielding solutions dominated by some solutions from the upper bound set. The effectiveness of the approach is shown on a sample of benchmark problems.