Modify the CPL Lagrangian heuristic to account for the case where the demand is indivisible (i.e. the demand of any successor node must be satisfied by a single facility).
Is the modified heuristic still time-polynomial? How can be one determine whether an instance of the modified problem is feasible?