A parallelizable algorithm for constrained maximization of preferences in large time-dependent graphs