bomip

BOMIP (Bi-Objective Mixed Integer Programming) is a class of problem where two objective functions are minimized subject to linear constraints and integrality on a subset of variables. This project is an implementation of a branch-and-bound algorithm for BOMIP problems.