To overcome this bottleneck, our parse, price and cut algorithm, as shown in algorithm 1, uses column and row generation.
it lazily instantiates the grandparent edge variables z gp g,p,c , and the corresponding cubic number of constraints.