In this work, we give a formal framework to design multiobjective branch-and-bound procedures, and we provide a generalization of the lower bounding concept, able to more tightly bound the Pareto front of a sub-problem. We tested our approach on the bi-objective spanning tree problem. It significantly improves the existing results for the problem.