Comments on: Perspectives on integer programming for time-dependent models
暂无分享,去创建一个
[1] Amelia Regan,et al. On the convergence of a new time window discretization method for the traveling salesman problem with time window constraints , 2009, Comput. Ind. Eng..
[2] Matteo Fischetti,et al. Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Solving the Asymmetric Travelling Salesman Problem with Time Windows by Branch-and-cut Solving the Asymmetric Travelling Salesman Problem with Time Windows by Branch-and-cut , 2022 .
[3] M. Grötschel,et al. A polyhedral study of the asymmetric traveling salesman problem with time windows , 2000 .
[4] Roberto Roberti,et al. New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows , 2012, INFORMS J. Comput..
[5] Eduardo Lalla-Ruiz,et al. A multi-mode resource-constrained project scheduling reformulation for the waterway ship scheduling problem , 2019, J. Sched..
[6] Sanjeeb Dash,et al. A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows , 2012, INFORMS J. Comput..
[7] Leif H. Appelgren,et al. A Column Generation Algorithm for a Ship Scheduling Problem , 1969 .
[8] Amos Levin. Scheduling and Fleet Routing Models for Transportation Systems , 1971 .