Improved Branch-Cut-and-Price for Capacitated Vehicle Routing
暂无分享,去创建一个
[1] Marcus Poggi de Aragão,et al. Efficient elementary and restricted non-elementary route pricing , 2014, Eur. J. Oper. Res..
[2] Stefan Irnich,et al. Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling , 2010, INFORMS J. Comput..
[3] James P. Kelly,et al. The Impact of Metaheuristics on Solving the Vehicle Routing Problem: Algorithms, Problem Sets, and Computational Results , 1998 .
[4] Adam N. Letchford,et al. A new branch-and-cut algorithm for the capacitated vehicle routing problem , 2004, Math. Program..
[5] Marcus Poggi de Aragão,et al. Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems , 2008 .
[6] Renato F. Werneck,et al. Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem , 2006, Math. Program..
[7] Nicos Christofides,et al. An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts , 2008, Math. Program..
[8] David Pisinger,et al. Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows , 2008, Oper. Res..
[9] Paolo Toth,et al. Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations , 1981, Math. Program..
[10] Rafael Martinelli,et al. A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints , 2014, Discret. Optim..
[11] Roberto Roberti,et al. New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem , 2011, Oper. Res..
[12] Ruslan Sadykov,et al. In-Out Separation and Column Generation Stabilization by Dual Price Smoothing , 2013, SEA.
[13] Giovanni Righini,et al. Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints , 2006, Discret. Optim..
[14] Marcus Poggi de Aragão,et al. Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems , 2010, Math. Program. Comput..