Shortest Path Problems with Resource Constraints
暂无分享,去创建一个
[1] Sylvie Gélinas,et al. A dynamic programming algorithm for the shortest path problem with time windows and linear node costs , 1994, Networks.
[2] Jacques Desrosiers,et al. Time Constrained Routing and Scheduling , 1992 .
[3] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[4] Michel Gendreau,et al. An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems , 2004, Networks.
[5] André Langevin,et al. Dispatching and Conflict-Free Routing of Automated Guided Vehicles: An Exact Approach , 2002 .
[6] Amal de Silva. Combining Constraint Programming and Linear Programming on an Example of Bus Driver Scheduling , 2001, Ann. Oper. Res..
[7] Jacques Desrosiers,et al. Crew Pairing at Air France , 1993 .
[8] Guy Desaulniers,et al. The shortest path problem with forbidden paths , 2002, Eur. J. Oper. Res..
[9] Jacques Desrosiers,et al. A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems , 1998 .
[10] Niklas Kohl,et al. Exact methods for time constrained routing and related scheduling problems , 1995 .
[11] Alfred V. Aho,et al. Efficient string matching , 1975, Commun. ACM.
[12] Jacques Desrosiers,et al. VRP with Pickup and Delivery , 2000, The Vehicle Routing Problem.
[13] George L. Nemhauser,et al. Handbooks in operations research and management science , 1989 .
[14] Alexander H. G. Rinnooy Kan,et al. Vehicle Routing with Time Windows , 1987, Oper. Res..
[15] J. Desrosiers,et al. Plus court chemin avec contraintes d'horaires , 1983 .
[16] Martin Desrochers,et al. A Column Generation Approach to the Urban Transit Crew Scheduling Problem , 1987, Transp. Sci..
[17] Jon Louis Bentley,et al. Multidimensional divide-and-conquer , 1980, CACM.
[18] Michel Gendreau,et al. Solving VRPTWs with Constraint Programming Based Column Generation , 2004, Ann. Oper. Res..
[19] George L. Nemhauser,et al. Airline Crew Scheduling: A New Formulation and Decomposition Algorithm , 1997, Oper. Res..
[20] R. Borndoerfer,et al. Scheduling duties by adaptive column generation , 2001 .
[21] Martin W. P. Savelsbergh,et al. Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..
[22] Alain Chabrier,et al. Vehicle Routing Problem with elementary shortest path based column generation , 2006, Comput. Oper. Res..
[23] Zhi-Long Chen,et al. Solving a Practical Pickup and Delivery Problem , 2003, Transp. Sci..
[24] Anthony Wren,et al. Computer Scheduling of Public Transportation: Urban Passenger Vehicle and Crew Scheduling , 1981 .
[25] Jesper Larsen,et al. Parallelization of the Vehicle Routing Problem with Time Windows , 1999 .
[26] Jacques Desrosiers,et al. A Column Generation Approach for Large-Scale Aircrew Rostering Problems , 1999, Oper. Res..
[27] Jacques Desrosiers,et al. The Preferential Bidding System at Air Canada , 1997, Transp. Sci..
[28] Jacques Desrosiers,et al. Crew pairing for a regional carrier , 1997 .
[29] Nicos Christofides,et al. An algorithm for the resource constrained shortest path problem , 1989, Networks.
[30] Stefan E. Karisch,et al. Constraint Programming Based Column Generation for Crew Assignment , 2002, J. Heuristics.
[31] Warren B. Powell,et al. A generalized threshold algorithm for the shortest path problem with time windows , 1997, Network Design: Connectivity and Facilities Location.
[32] Martin W. P. Savelsbergh,et al. Drive: Dynamic Routing of Independent Vehicles , 1998, Oper. Res..
[33] Helman I. Stern,et al. COMPUTER SCHEDULING OF PUBLIC TRANSPORT. URBAN PASSENGER VEHICLE AND CREW SCHEDULING. PAPERS BASED ON PRESENTATIONS AT THE INTERNATIONAL WORKSHOP HELD AT THE UNIVERSITY OF LEEDS, 16-18 JULY, 1980 (CONTD) , 1981 .
[34] J. Desrosiers,et al. Methods for routing with time windows , 1986 .
[35] M. Desrochers,et al. A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows , 1988 .
[36] Guy Desaulniers,et al. The Shortest Path Problem with Time Windows and Linear Waiting Costs , 1997, Transp. Sci..
[37] Jacques Desrosiers,et al. The Pickup and Delivery Problem with Time Windows , 1989 .
[38] Martin Desrochers,et al. Computer-Aided Transit Scheduling , 1992 .
[39] Martin Desrochers,et al. A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..
[40] Kamlesh Mathur,et al. Vehicle Routing and Scheduling with Full Truckloads , 2003, Transp. Sci..
[41] Teodor Gabriel Crainic,et al. Fleet management and logistics , 1998 .
[42] Hokey Min,et al. The multiple vehicle routing problem with simultaneous delivery and pick-up points , 1989 .
[43] Moshe Dror,et al. Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW , 1994, Oper. Res..
[44] Jacques Desrosiers,et al. Technical Note - Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs , 1989, Transp. Sci..
[45] Jacques Desrosiers,et al. Routing with time windows by column generation , 1983, Networks.
[46] Stefan Irnich,et al. The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k 3 , 2006, INFORMS J. Comput..
[47] Marius M. Solomon,et al. Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..