Vehicle Routing and Crew Scheduling Problems ...
Sub-Problem is strongly NP-hard
It does not posses the Integrality Property
Master Problem results in Set Partitioning/Covering type Problems
Branching and Cutting decisions are taken on the original network flow, resource and supplementary variables