- Anily, S. ; Bramel, J. Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries. 1999 Naval Research Logistics. 46 654-670
Paper not yet in RePEc: Add citation now
- Anily, S. ; Gendreau, M. ; Laporte, G. The swapping problem on a line. 1999 SIAM Journal on Computing. 29 327-335
Paper not yet in RePEc: Add citation now
- Anily, S. ; Hassin, R. The swapping problem. 1992 Networks. 22 419-433
Paper not yet in RePEc: Add citation now
- Applegate, D.L. ; Bixby, R.E. ; Chvátal, V. ; Cook, W.J. . 2006 Princeton University Press: Princeton, NJ
Paper not yet in RePEc: Add citation now
Bektas, T. Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing. 2012 European Journal of Operational Research. 216 83-93
- Benchakroun, A. ; Ferland, J.A. ; Cléroux, R. Distribution system planning through a generalized Benders decomposition approach. 1991 European Journal of Operational Research. 62 149-162
Paper not yet in RePEc: Add citation now
- Benders, J.F. Partitioning procedures for solving mixed-variables programming problems. 1962 Numerische Mathematik. 4 238-252
Paper not yet in RePEc: Add citation now
Berbeglia, G. ; Cordeau, J.-F. ; Gribkovskaia, I. ; Laporte, G. Static pickup and delivery problems: A classification scheme and survey. 2007 Top. 15 1-31
- Bertsekas, D.P. . 1999 Athena Scientific: Belmont
Paper not yet in RePEc: Add citation now
- Bertsimas, D. ; Tsitsiklis, J.N. . 1997 Athena Scientific: Belmont
Paper not yet in RePEc: Add citation now
Bloom, J.A. Solving an electricity generating capacity expansion planning problem by generalized Benders’ decomposition. 1983 Operations Research. 31 84-100
- Burkard, R. ; Dell’Amico, M. ; Martello, S. . 2009 SIAM: Philadelphia
Paper not yet in RePEc: Add citation now
- Chalasani, P. ; Motwani, R. Approximating capacitated routing and delivery problems. 1999 SIAM Journal on Computing. 28 2133-2149
Paper not yet in RePEc: Add citation now
- Christofides, N. ; Mingozzi, A. ; Toth, P. The vehicle routing problem. 1979 En : Christofides, N. ; Mingozzi, A. ; Toth, P. ; Sandi, C. Combinatorial optimization. Wiley: Chichester
Paper not yet in RePEc: Add citation now
- Cook, W.J. In pursuit of the traveling salesman: Mathematics at the limits of computation. 2012 Princeton University Press: Princeton, NJ
Paper not yet in RePEc: Add citation now
- Cordeau, J.-F. ; Laporte, G. The dial-a-ride problem (DARP): Variants, modeling issues and algorithms. 2003 4OR: A Quarterly Journal of Operations Research. 1 89-101
Paper not yet in RePEc: Add citation now
Cordeau, J.-F. ; Soumis, F. ; Desrosiers, J. A Benders decomposition approach for the locomotive and car assignment problem. 2000 Transportation Science. 34 133-149
Cordeau, J.-F. ; Soumis, F. ; Desrosiers, J. Simultaneous assignment of locomotives and cars to passenger trains. 2001 Operations Research. 49 531-548
Dantzig, G. ; Fulkerson, R. ; Johnson, S. Solution of a large-scale traveling-salesman problem. 1954 Journal of the Operations Research Society of America. 2 393-410
Desaulniers, G. ; Desrosiers, J. ; Dumas, Y. ; Solomon, M.M. ; Soumis, F. Daily aircraft routing and scheduling. 1997 Management Science. 43 841-855
Federgruen, A. ; Zipkin, P. A combined vehicle routing and inventory allocation problem. 1984 Operations Research. 32 1019-1037
- Fisher, M.L. ; Jaikumar, R. A generalized assignment heuristic for vehicle routing. 1981 Networks. 11 109-124
Paper not yet in RePEc: Add citation now
- Gendreau, M. ; Laporte, G. ; Vigo, D. Heuristics for the traveling salesman problem with pickup and delivery. 1999 Computers & Operations Research. 26 699-714
Paper not yet in RePEc: Add citation now
- Geoffrion, A.M. Generalized Benders decomposition. 1972 Journal of Optimization Theory and Applications. 10 237-260
Paper not yet in RePEc: Add citation now
Geoffrion, A.M. ; Graves, G.W. Multicommodity distribution system design by Benders decomposition. 1974 Management Science. 20 822-844
- Gutin, G. ; Punnen, A.P. . 2002 Kluwer Academic Publishers: Dordrecht
Paper not yet in RePEc: Add citation now
- Hernández-Pérez, H. ; RodrÃguez-MartÃn, I. ; Salazar-González, J.-J. A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem. 2009 Computers & Operations Research. 36 1639-1645
Paper not yet in RePEc: Add citation now
- Hernández-Pérez, H. ; Salazar-González, J.-J. A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery. 2004 Discrete Applied Mathematics. 145 126-139
Paper not yet in RePEc: Add citation now
- Hernández-Pérez, H. ; Salazar-González, J.-J. Heuristics for the one-commodity pickup-and-delivery traveling salesman problem. 2004 Transportation Science. 38 245-255
Paper not yet in RePEc: Add citation now
- Hoang, H.H. Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition. 1982 IEEE Transactions on Automatic Control. 27 164-169
Paper not yet in RePEc: Add citation now
- Hoffman, K. ; Padberg, M. LP-based combinatorial problem solving. 1985 Annals of Operations Research. 4 145-194
Paper not yet in RePEc: Add citation now
- Hosny, M. ; Mumford, C. Solving the one-commodity pickup and delivery problem using an adaptive hybrid VNS/SA approach. 2010 En : Schaefer, R. ; Cotta, C. ; Kolodziej, J. ; Rudolph, G. Parallel problem solving from nature, PPSN XI. Springer: Berlin
Paper not yet in RePEc: Add citation now
Lahyani, R. ; Khemakhem, M. ; Semet, F. Rich vehicle routing problems: From a taxonomy to a definition. 2015 European Journal of Operational Research. 241 1-14
Macharis, C. ; Bontekoning, Y.M. Opportunities for OR in intermodal freight transport research: A review. 2004 European Journal of Operational Research. 153 400-416
Magnanti, T.L. ; Wong, R.T. Accelerating Benders decomposition: Algorithmic enhancement and model selection criteria. 1981 Operations Research. 29 464-484
- Martinovic, G. ; Aleksi, I. ; Baumgartner, A. Single-commodity vehicle routing problem with pickup and delivery service. 2008 Mathematical Problems in Engineering. 2008 1-17
Paper not yet in RePEc: Add citation now
Mercier, A. A theoretical comparison of feasibility cuts for the integrated aircraft-routing and crew-pairing problem. 2008 Transportation Science. 42 87-104
- Mercier, A. ; Cordeau, J.-F. ; Soumis, F. A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem. 2005 Computers & Operations Research. 32 1451-1476
Paper not yet in RePEc: Add citation now
Nossack, J. ; Pesch, E. A truck scheduling problem arising in intermodal container transportation. 2013 European Journal of Operational Research. 230 666-680
- Parragh, S.N. ; Doerner, K.F. ; Hartl, R.F. A survey on pickup and delivery problems. Part I: Transportation between customers and depot. 2008 Journal für Betriebswirtschaft. 58 21-51
Paper not yet in RePEc: Add citation now
- Parragh, S.N. ; Doerner, K.F. ; Hartl, R.F. A survey on pickup and delivery problems. Part II: Transportation between pickup and delivery locations. 2008 Journal für Betriebswirtschaft. 58 81-117
Paper not yet in RePEc: Add citation now
Pillac, V. ; Gendreau, M. ; Guéret, C. ; Medaglia, A.L. A review of dynamic vehicle routing problems. 2013 European Journal of Operational Research. 225 1-11
Richardson, R. An optimization approach to routing aircraft. 1976 Transportation Science. 10 52-71
Savelsbergh, M.W.P. ; Sol, M. The general pickup and delivery problem. 1995 Transportation Science. 29 17-29
- Schrijver, A. . 2003 Springer: Berlin
Paper not yet in RePEc: Add citation now
Sexton, T.R. ; Bodin, L.D. Optimizing single vehicle many-to-many operations with desired delivery times: I. Scheduling. 1985 Transportation Science. 19 378-410
Sexton, T.R. ; Bodin, L.D. Optimizing single vehicle many-to-many operations with desired delivery times: II. Routing. 1985 Transportation Science. 19 411-435
Solomon, M.M. Algorithms for the vehicle routing and scheduling problems with time window constraints. 1987 Operations Research. 35 254-265
- Wang, F. ; Lim, A. The one-commodity pickup and delivery travelling salesman problem on a path or a tree. 2006 Networks. 48 24-35
Paper not yet in RePEc: Add citation now
- Zhang, R. ; Yun, W.Y. ; Kopfer, H. Heuristic-based truck scheduling for inland container transportation. 2010 OR Spectrum. 32 787-808
Paper not yet in RePEc: Add citation now
- Zhao, F. ; Li, S. ; Sun, J. ; Mei, D. Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem. 2009 Computers & Industrial Engineering. 56 1642-1648
Paper not yet in RePEc: Add citation now