A Branch and Bound Algorithm for a Class of Biobjective Mixed Integer Programs

What is it about?

The article describe a new branch and bound algorithm, which can solve a class of Mixed Integer programming Problems (MIP) with two objective functions

Featured Image

Why is it important?

Most (all !) real Operations Research are multi-objective by nature, but most are solved as single-objective problems because of the lack of standard optimization algorithms. This article describe some of the steps toward such a general bi-objective branch and bound algorithm.