Branch-and-Refine for Solving Time-Dependent Problems
One of the standard approaches for solving time-dependent discrete optimization problems, such as the traveling salesman problem with time-windows or the shortest path problem with time-windows, is to derive a so-called time-indexed formulation. If the problem has an underlying structure that can be described by a graph, the time-indexed formulation is usually based on a … Read more