Python package for implementing branch-and-bound technique for solving a non-convex non-linear integer multi-objective optimization problem?

Here, X1 and X2 take integer values. I want to use branch-and-bound technique to solve this problem. What are the python tools available to solve this problem?

from Python package for implementing branch-and-bound technique for solving a non-convex non-linear integer multi-objective optimization problem?