Resumen de Comments on: Perspectives on integer programming for time-dependent models 1

Sanjeeb Dash

• In the paper, “Perspectives on Integer Programming for Time-Dependent models”, Boland and Savelsbergh discuss integer programming (IP) models of optimization problems involving activities that have time restrictions, or resources that vary with time [both aspects are present in a recent paper by Hill et al. (2018)]. Such problems are common in many industrial applications and are often very hard to solve. The Traveling Salesman Problem with Time Windows (TSPTW) is an important “time-dependent model” that combines routing and scheduling issues, and Boland and Savelsbergh illustrate techniques to handle time-dependent models on the TSPTW.