An algorithmic framework in the criterion space for bi-objective mixed integer linear problems
We propose a flexible and general algorithmic framework for solving bi-objective mixed integer linear programming problems. The Pareto frontier of these problems can have a complex structure, as it can include isolated points, open, half-open and closed line segments. Therefore, its exact detection is an achievable though hard computational task. Operating in the criterion space, … Read more