I can't get my head around how to implement different subproblems in a column generation procedure with only one master problem.
Say the computer found a resource constraint shortest path for each unique subproblem at some iteration in the column generation procedure. Then what? Should all shortest paths be added to the set of paths? And when the path(s) is/are added to the restricted master problem, how does the computer know exactly which person/vehicle to allocate the path?