Most real-world optimization problems are multi-objective by nature, with conflicting and incomparable objectives. Solving a multi-objective optimization problem requires a method which can generate all rational compromises between the objectives. This paper proposes two distinct bound set based branch-and-cut algorithms for general bi-objective combinatorial optimization problems, based on implicit and explicit lower bound sets, respectively. The algorithm based on explicit lower bound sets computes, for each branching
node, a lower bound set and compares it to an upper bound set. The other fathoms branching nodes by generating a single point on the lower bound set for each local nadir point. We outline several approaches for fathoming branching nodes and we propose an updating scheme for the lower bound sets that prevents us from solving the bi-objective LP-relaxation of each branching node. To strengthen the lower bound sets, we propose a bi-objective cutting plane algorithm that adjusts the weights of the objective functions such that
different parts of the feasible set are strengthened by cutting planes. In addition, we suggest an extension of the branching strategy "Pareto branching". We prove the effectiveness of the algorithms through extensive computational results.