Subsequently, we present a general algorithmic framework to solve the QMRP in an online manner. 
given the computational complexity of the problem, we employ a sampleselect approach, where in the first stage, a set of feasible paths is sampled, and subsequently one of them is selected for the actual embedding (cf. Section 4.2).