A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
暂无分享,去创建一个
[1] Celso C. Ribeiro,et al. A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem , 1991, Oper. Res..
[2] Jacques Desrosiers,et al. Time Constrained Routing and Scheduling , 1992 .
[3] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[4] Alan A. Bertossi,et al. On some matching problems arising in vehicle scheduling models , 1987, Networks.
[5] Michael Forbes,et al. An exact algorithm for multiple depot bus scheduling , 1994 .
[6] Jacques Desrosiers,et al. Crew Scheduling in Air Transportation , 1998 .
[7] Lawrence Bodin,et al. UCOST: A MICRO APPROACH TO A TRANSPORTATION PLANNING PROBLEM , 1978 .
[8] L. Bianco,et al. A set partitioning approach to the multiple depot vehicle scheduling problem , 1994 .
[9] Guy Desaulniers,et al. Multi-depot vehicle scheduling problems with time windows and waiting costs , 1996, Eur. J. Oper. Res..
[10] Matteo Fischetti,et al. A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems , 2001, Manag. Sci..
[11] Matteo Fischetti,et al. A branch and bound algorithm for the multiple depot vehicle scheduling problem , 1989, Networks.
[12] R. Kraut,et al. Vehicle scheduling in public transit and Lagrangean pricing , 1998 .
[13] Jacques Desrosiers,et al. A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems , 1998 .
[14] Jacques Desrosiers,et al. 2-Path Cuts for the Vehicle Routing Problem with Time Windows , 1997, Transp. Sci..
[15] Jacques Desrosiers,et al. Chapter 2 Time constrained routing and scheduling , 1995 .
[16] J. Edmonds,et al. Facets of I-matching polyhedra , 1974 .