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

Sanjeeb Dash ^[1]
1. [1] IBM Research – Thomas J. Watson Research Center
  
  IBM Research – Thomas J. Watson Research Center
  
  Town of Yorktown, Estados Unidos
Localización: Top, ISSN-e 1863-8279, ISSN 1134-5764, Vol. 27, Nº. 2, 2019, págs. 174-177
Idioma: inglés
DOI: 10.1007/s11750-019-00511-7
Enlaces
- Texto completo
Resumen
- 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.