Branch-and-refine for solving time-expanded MILP formulations
One of the standard approaches for solving discrete optimization problems which include the aspect of time, 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. …