In this chapter, we present algorithms for solving RTP. Solutions must adhere to all constraints described in the previous chapter. Since it is not obvious what kind of algorithmic strategy (i.e. what algorithm family) is most promising for solving RTP, we develop solutions across the full spectrum of algorithm engineering: our approaches range from greedy heuristics, to metaheuristics involving randomness, and exact algorithms.