Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
