Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
暂无分享,去创建一个
Renato F. Werneck | Marcus Poggi de Aragão | Eduardo Uchoa | Ricardo Fukasawa | Jens Lysgaard | Marcelo L. Reis | Humberto Longo
[1] Terry P. Harrison,et al. Lot-Sizing with Start-Up Times , 1998 .
[2] Donald L. Miller. A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems , 1995, INFORMS J. Comput..
[3] Adam N. Letchford,et al. A new branch-and-cut algorithm for capacitated vehicle routing problems , 2003 .
[4] Renato F. Werneck,et al. Finding minimum congestion spanning trees , 1999, JEAL.
[5] Thomas L. Magnanti,et al. Capacitated trees, capacitated routing, and associated polyhedra , 1990 .
[6] W. Wilhelm. A Technical Review of Column Generation in Integer Programming , 2001 .
[7] Thomas L. Morin,et al. A branch-and-cut algorithm for vehicle routing problems , 1994, Ann. Oper. Res..
[8] Martin W. P. Savelsbergh,et al. Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..
[9] Juan José Salazar González,et al. Projection results for vehicle routing , 2005, Math. Program..
[10] Adam N. Letchford,et al. Multistars, partial multistars and the capacitated vehicle routing problem , 2002, Math. Program..
[11] Giovanni Felici,et al. Solving large MIP models in supply chain management by branch & cut , 2000 .
[12] Harvey M. Salkin,et al. A set-partitioning-based exact algorithm for the vehicle routing problem , 1989, Networks.
[13] Nicos Christofides,et al. An Algorithm for the Vehicle-dispatching Problem , 1969 .
[14] Giovanni Rinaldi,et al. Computational results with a branch and cut code for the capacitated vehicle routing problem , 1998 .
[15] Nicos Christofides,et al. A new exact algorithm for the vehicle routing problem based onq-paths andk-shortest paths relaxations , 1995, Ann. Oper. Res..
[16] Lou Caccetta,et al. An Improved Branch - and - Cut Algorithm for the Capacitated Vehicle Routing Problem , 2003, Transp. Sci..
[17] Cynthia Barnhart,et al. Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems , 2000, Oper. Res..
[18] M. R. Rao,et al. Odd Minimum Cut-Sets and b-Matchings , 1982, Math. Oper. Res..
[19] Paolo Toth,et al. Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations , 1981, Math. Program..
[20] Leslie E. Trotter,et al. On the capacitated vehicle routing problem , 2003, Math. Program..
[21] Adam N. Letchford,et al. A new branch-and-cut algorithm for the capacitated vehicle routing problem , 2004, Math. Program..
[22] Abilio Lucena,et al. Stronger K-tree relaxations for the vehicle routing problem , 2004, Eur. J. Oper. Res..
[23] Ted K. Ralphs,et al. Parallel branch and cut for capacitated vehicle routing , 2003, Parallel Comput..
[24] George B. Dantzig,et al. The Truck Dispatching Problem , 1959 .
[25] Giovanni Rinaldi,et al. Branch-And-Cut Algorithms for the Capacitated VRP , 2001, The Vehicle Routing Problem.
[26] Paolo Toth,et al. State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.
[27] Gérard Cornuéjols,et al. Polyhedral study of the capacitated vehicle routing problem , 1993, Math. Program..
[28] Marcus Poggi de Aragão,et al. Solving capacitated arc routing problems using a transformation to the CVRP , 2006, Comput. Oper. Res..
[29] Paolo Toth,et al. Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..
[30] Jacques Desrosiers,et al. 2-Path Cuts for the Vehicle Routing Problem with Time Windows , 1997, Transp. Sci..
[31] Renato F. Werneck,et al. Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem , 2004, Math. Program..
[32] M. Balinski,et al. On an Integer Program for a Delivery Problem , 1964 .
[33] Marshall L. Fisher,et al. Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees , 1994, Oper. Res..
[34] Martin W. P. Savelsbergh,et al. Time-Indexed Formulations for Machine Scheduling Problems: Column Generation , 2000, INFORMS J. Comput..
[35] Nicos Christofides,et al. New exact algorithms for the vehicle routing problem , 1994 .
[36] Ángel Corberán,et al. Separating capacity constraints in the CVRP using tabu search , 1998, Eur. J. Oper. Res..
[37] Klaus Wenger. Generic Cut Generation Methods for Routing Problems , 2004 .
[38] Cynthia Barnhart,et al. Multimodal Express Package Delivery: A Service Network Design Application , 1999, Transp. Sci..
[39] G. Laporte,et al. A branch and bound algorithm for the capacitated vehicle routing problem , 1983 .
[40] Martin Desrochers,et al. A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..
[41] Gerhard Reinelt,et al. A Faster Exact Separation Algorithm for Blossom Inequalities , 2004, IPCO.
[42] Stefan Irnich,et al. The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k 3 , 2006, INFORMS J. Comput..
[43] Ángel Corberán,et al. Polyhedral results for a vehicle routing problem , 1991 .
[44] Paolo Toth,et al. The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.