Bi-objective combinatorial optimization (BOCO) deals with mathematical programming models where two competing objectives have to be minimised subject to constraints. A number of real world applications may be cast in this setting, where the objective and constraint functions are linear and the variables are binary. In a BOCO problem usually there is no solution that simultaneously minimise both objectives, so it is necessary to describe a set of Pareto optimal solutions, or solutions such that it is not possible to improve one objective without worsening the other. In this work we review...