The Cutting Stock Problem : Valerio de Carvalhó ...
The sub-problem is a shortest path problem on a acyclic network.
This Column Generator only brings back extreme ray columns,
the single extreme point being the null vector.
The Master Problem appears without the convexity constraint.
The correspondence with Gilmore-Gomory formulation is obvious.
Branch & Bound performed on