A branch-cut-and-price algorithm for a dial-a-ride problem with minimum disease-transmission risk - 42Papers