Drive: Dynamic Routing of Independent Vehicles
暂无分享,去创建一个
[1] Martin W. P. Savelsbergh,et al. Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..
[2] M Marc Sol. Column generation techniques for pickup and delivery problems , 1994 .
[3] Jacques Desrosiers,et al. Time Constrained Routing and Scheduling , 1992 .
[4] P. Toth,et al. Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem , 1980 .
[5] George L. Nemhauser,et al. Solving binary cutting stock problems by column generation and branch-and-bound , 1994, Comput. Optim. Appl..
[6] Ellis L. Johnson,et al. A Global Approach to Crew-Pairing Optimization , 1992, IBM Syst. J..
[7] Martin Desrochers,et al. A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..
[8] Martin W. P. Savelsbergh,et al. MINTO, a mixed INTeger optimizer , 1994, Oper. Res. Lett..
[9] Martin W. P. Savelsbergh,et al. The General Pickup and Delivery Problem , 1995, Transp. Sci..
[10] Mwp Martin Savelsbergh,et al. Local search in physical distribution management , 1992 .
[11] Martin W. P. Savelsbergh,et al. A Branch-and-Price Algorithm for the Generalized Assignment Problem , 1997, Oper. Res..