Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem
暂无分享,去创建一个
Martin W. P. Savelsbergh | George L. Nemhauser | Faramroze G. Engineer | G. Nemhauser | M. Savelsbergh | F. Engineer
[1] Giovanni Righini,et al. Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints , 2006, Discret. Optim..
[2] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[3] Jacques Desrosiers,et al. Time Constrained Routing and Scheduling , 1992 .
[4] Martin W. P. Savelsbergh,et al. Per-Seat, On-Demand Air Transportation Part I: Problem Description and an Integer Multicommodity Flow Model , 2008, Transp. Sci..
[5] Michel Gendreau,et al. New Refinements for the Solution of Vehicle Routing Problems with Branch and Price , 2007, INFOR Inf. Syst. Oper. Res..
[6] Giovanni Righini,et al. New dynamic programming algorithms for the resource constrained elementary shortest path problem , 2008, Networks.
[7] Nicos Christofides,et al. An algorithm for the resource constrained shortest path problem , 1989, Networks.
[8] David Pisinger,et al. Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows , 2008, Oper. Res..
[9] Stefan Irnich,et al. Shortest Path Problems with Resource Constraints , 2005 .
[10] M H Farahi,et al. AN ALGORITHM FOR THE SHORTEST PATH PROBLEM , 2005 .
[11] L MarcoE.,et al. Dual variable based fathoming in dynamic programs for column generation , 2004 .
[12] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[13] Marco E. Lübbecke,et al. Dual variable based fathoming in dynamic programs for column generation , 2005, Eur. J. Oper. Res..
[14] Danny Raz,et al. A simple efficient approximation scheme for the restricted shortest path problem , 2001, Oper. Res. Lett..
[15] Refael Hassin,et al. Approximation Schemes for the Restricted Shortest Path Problem , 1992, Math. Oper. Res..
[16] Renan Garcia,et al. Resource constrained shortest paths and extensions , 2009 .
[17] Simon Spoorendonk,et al. A Branch-and-Cut Algorithm for the Elementary Shortest Path Problem with a Capacity Constraint , 2008 .
[18] Gabriel Y. Handler,et al. A dual algorithm for the constrained shortest path problem , 1980, Networks.
[19] Kurt Mehlhorn,et al. Resource Constrained Shortest Paths , 2000, ESA.
[20] Natashia Boland,et al. Accelerated label setting algorithms for the elementary resource constrained shortest path problem , 2006, Oper. Res. Lett..
[21] Jean-François Cordeau,et al. Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows , 2009, Transp. Sci..
[22] Michel Gendreau,et al. An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems , 2004, Networks.
[23] I. Dumitrescu,et al. Algorithms for the Weight Constrained Shortest Path Problem , 2001 .