Routing and scheduling problems

[1]  M. Sol.  The general pickup and delivery problem , 2010 .

[2]  Guy Desaulniers,et al.  Tabu Search, Partial Elementarity, and Generalized k-Path Inequalities for the Vehicle Routing Problem with Time Windows , 2006, Transp. Sci..

[3]  Thomas J. Crowe,et al.  The Missouri Lottery Optimizes Its Scheduling and Routing to Improve Efficiency and Balance , 2006, Interfaces.

[4]  Sophie N. Parragh,et al.  A survey on pickup and delivery models Part II : Transportation between pickup and delivery locations , 2007 .

[5]  David Pisinger,et al.  Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows , 2008, Oper. Res..

[6]  Mikael Rönnqvist,et al.  Operations Research Improves Quality and Efficiency in Home Care , 2009, Interfaces.

[7]  Brian Kallehauge,et al.  Formulations and exact algorithms for the vehicle routing problem with time windows , 2008, Comput. Oper. Res..

[8]  Robert E. Tarjan,et al.  Efficient algorithms for finding minimum spanning trees in undirected and directed graphs , 1986, Comb..

[9]  Ping Chen,et al.  Multiple crossdocks with inventory and time windows , 2006, Comput. Oper. Res..

[10]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[11]  David S. Johnson,et al.  The Complexity of Computing Steiner Minimal Trees , 1977 .

[12]  Roberto Roberti,et al.  An exact solution framework for a broad class of vehicle routing problems , 2010, Comput. Manag. Sci..

[13]  Jan Karel Lenstra,et al.  The complexity of the network design problem , 1978, Networks.