Our formulation can enforce both types of constraints or only one of them without changing the resolution method.
in order to retrieve an optimal solution in all cases, we embed the Lagrangian Relaxation of the problem within a Branch-and-Bound procedure (Land and Doig, 1960).