-
1
-
-
0026417892
-
Integer linear programming formulation for a vehicle routing problem
-
DOI 10.1016/0377-2217(91)90338-V
-
N.R. Achuthan, and L. Caccetta Integer linear programming formulation for a vehicle routing problem European Journal of Operational Research 52 1 1991 86 89 (Pubitemid 21668524)
-
(1991)
European Journal of Operational Research
, vol.52
, Issue.1
, pp. 86-89
-
-
Achuthan, N.R.1
Caccetta, L.2
-
2
-
-
0003875064
-
Computational results with a branch and cut code for the capacitated vehicle routing problem
-
ARTEMIS-IMAG, Grenoble France
-
Augerat, P.; Belenguer, J.M.; Benavent, E.; Corberán, A.; Naddef, D.; Rinaldi, G.; 1995. Computational results with a branch and cut code for the capacitated vehicle routing problem. Tech. Rep. 1 RR949-M, ARTEMIS-IMAG, Grenoble France.
-
(1995)
Tech. Rep. 1 RR949-M
-
-
Augerat, P.1
Belenguer, J.M.2
Benavent, E.3
Corberán, A.4
Naddef, D.5
Rinaldi, G.6
-
3
-
-
8344229228
-
An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation
-
R. Baldacci, E. Hadjiconstantinou, and A. Mingozzi An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation Operations Research 52 2004 723 738
-
(2004)
Operations Research
, vol.52
, pp. 723-738
-
-
Baldacci, R.1
Hadjiconstantinou, E.2
Mingozzi, A.3
-
4
-
-
45149121178
-
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
-
R. Baldacci, N. Christofides, and A. Mingozzi An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts Mathematical Programming Series A 115 2 2008 351 385
-
(2008)
Mathematical Programming Series A
, vol.115
, Issue.2
, pp. 351-385
-
-
Baldacci, R.1
Christofides, N.2
Mingozzi, A.3
-
5
-
-
81455135706
-
New route relaxation and pricing strategies for the vehicle routing problem
-
in press
-
Baldacci, R.; Mingozzi, A.; Roberti, R.; in press. New route relaxation and pricing strategies for the vehicle routing problem. Operations Research.
-
Operations Research
-
-
Baldacci, R.1
Mingozzi, A.2
Roberti, R.3
-
6
-
-
0000495533
-
On an integer program for a delivery problem
-
M. Balinski, and R. Quandt On an integer program for a delivery problem Operations Research 12 1964 300 304
-
(1964)
Operations Research
, vol.12
, pp. 300-304
-
-
Balinski, M.1
Quandt, R.2
-
7
-
-
32044469861
-
Vehicle Routing Problem with elementary shortest path based column generation
-
DOI 10.1016/j.cor.2005.02.029, PII S0305054805000857, Constrain Programming
-
A. Chabrier Vehicle routing problem with elementary shortest path based column generation Computers & Operations Research 33 2006 2972 2990 (Pubitemid 43199835)
-
(2006)
Computers and Operations Research
, vol.33
, Issue.10
, pp. 2972-2990
-
-
Chabrier, A.1
-
8
-
-
34250247769
-
Exact algorithms for the vehicle routing problem based on spanning tree and shortest path relaxations
-
N. Christofides, A. Mingozzi, and P. Toth Exact algorithms for the vehicle routing problem based on spanning tree and shortest path relaxations Mathematical Programming 20 1 1981 255 282 (Pubitemid 12508234)
-
(1981)
Mathematical Programming
, vol.20
, Issue.3
, pp. 255-282
-
-
Christofides, N.1
Ningozzi, A.2
Toth, P.3
-
9
-
-
0006112432
-
The vrp with time windows
-
P. Toth, D. Vigo, SIAM Monographs on Discrete Mathematics and Applications Philadelphia
-
J.-F. Cordeau, G. Desaulniers, J. Desrosiers, M. Solomon, and F. Soumis The vrp with time windows P. Toth, D. Vigo, The Vehicle Routing Problem vol. 9 2002 SIAM Monographs on Discrete Mathematics and Applications Philadelphia 157 193
-
(2002)
The Vehicle Routing Problem
, vol.9
, pp. 157-193
-
-
Cordeau, J.-F.1
Desaulniers, G.2
Desrosiers, J.3
Solomon, M.4
Soumis, F.5
-
10
-
-
83955161163
-
Column generation
-
G. Desaulniers, J. Desrosiers, M.M. Solomon, Springer New York
-
E. Danna, and C. Le Pape Column generation G. Desaulniers, J. Desrosiers, M.M. Solomon, Accelerating Branch-and-price with Local Search: A Case Study on the Vehicle Routing Problem with Time Windows 2005 Springer New York 90 130
-
(2005)
Accelerating Branch-and-price with Local Search: A Case Study on the Vehicle Routing Problem with Time Windows
, pp. 90-130
-
-
Danna, E.1
Le Pape, C.2
-
11
-
-
70449635850
-
Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows
-
G. Desaulniers, F. Lessard, and A. Hadjar Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows Transportation Science 42 3 2008 387 404
-
(2008)
Transportation Science
, vol.42
, Issue.3
, pp. 387-404
-
-
Desaulniers, G.1
Lessard, F.2
Hadjar, A.3
-
12
-
-
85042163696
-
A new optimization algorithm for the vehicle-routing problem with time windows
-
M. Desrochers, J. Desrosiers, and M. Solomon A new optimization algorithm for the vehicle-routing problem with time windows Operations Research 40 2 1992 342 354
-
(1992)
Operations Research
, vol.40
, Issue.2
, pp. 342-354
-
-
Desrochers, M.1
Desrosiers, J.2
Solomon, M.3
-
13
-
-
4644250559
-
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
-
DOI 10.1002/net.20033
-
D. Feillet, P. Dejax, M. Gendreau, and C. Gueguen An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems Networks 44 2004 216 229 (Pubitemid 39301560)
-
(2004)
Networks
, vol.44
, Issue.3
, pp. 216-229
-
-
Feillet, D.1
Dejax, P.2
Gendreau, M.3
Gueguen, C.4
-
14
-
-
0000949089
-
A two-commodity network flow approach to the traveling salesman problem
-
G. Finke, A. Claus, and E. Gunn A two-commodity network flow approach to the traveling salesman problem Congress. Numerantium 41 1984 167 178
-
(1984)
Congress. Numerantium
, vol.41
, pp. 167-178
-
-
Finke, G.1
Claus, A.2
Gunn, E.3
-
15
-
-
33644515988
-
Robust branch-and-cut-and-price for the capacitated vehicle routing problem
-
R. Fukasawa, H. Longo, J. Lysgaard, M. Poggi de Aragão, M. Reis, E. Uchoa, and R. Werneck Robust branch-and-cut-and-price for the capacitated vehicle routing problem Mathematical Programming Series A 106 2006 491 511
-
(2006)
Mathematical Programming Series A
, vol.106
, pp. 491-511
-
-
Fukasawa, R.1
Longo, H.2
Lysgaard, J.3
Poggi De Aragão, M.4
Reis, M.5
Uchoa, E.6
Werneck, R.7
-
16
-
-
0002753134
-
Polyhedral theory
-
E. Lawler, J. Lenstra, A. Rinnooy Kan, D. Shmoys, John Wiley & Sons Ltd. Chichester
-
M. Grötschel, and M. Padberg Polyhedral theory E. Lawler, J. Lenstra, A. Rinnooy Kan, D. Shmoys, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization 1985 John Wiley & Sons Ltd. Chichester 231 305
-
(1985)
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
, pp. 231-305
-
-
Grötschel, M.1
Padberg, M.2
-
17
-
-
33748591592
-
The shortest-path problem with resource constraints and k-cycle elimination for k ≥ 3
-
DOI 10.1287/ijoc.1040.0117
-
S. Irnich, and D. Villeneuve The Shortest-Path problem with resource constraints and k-Cycle elimination for k>=3 INFORMS Journal on Computing 18 3 2006 391 406 (Pubitemid 44376263)
-
(2006)
INFORMS Journal on Computing
, vol.18
, Issue.3
, pp. 391-406
-
-
Irnich, S.1
Villeneuve, D.2
-
18
-
-
61449183550
-
Subset-row inequalities applied to the vehicle-routing problem with time windows
-
M. Jepsen, B. Petersen, S. Spoorendonk, and D. Pisinger Subset-row inequalities applied to the vehicle-routing problem with time windows Operations Research 56 2 2008 497 511
-
(2008)
Operations Research
, vol.56
, Issue.2
, pp. 497-511
-
-
Jepsen, M.1
Petersen, B.2
Spoorendonk, S.3
Pisinger, D.4
-
19
-
-
36348987653
-
Formulations and exact algorithms for the vehicle routing problem with time windows
-
DOI 10.1016/j.cor.2006.11.006, PII S0305054806002929, Selected Papers Presented at the ECCO'04 European Conference on Combinatorial Optimization
-
B. Kallehauge Formulations and exact algorithms for the vehicle routing problem with time windows Computers & Operations Research 35 7 2008 2307 2330 (Pubitemid 350161140)
-
(2008)
Computers and Operations Research
, vol.35
, Issue.7
, pp. 2307-2330
-
-
Kallehauge, B.1
-
20
-
-
2942531043
-
A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
-
I. Kara, G. Laporte, and T. Bektas A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem European Journal of Operational Research 158 3 2004 793 795
-
(2004)
European Journal of Operational Research
, vol.158
, Issue.3
, pp. 793-795
-
-
Kara, I.1
Laporte, G.2
Bektas, T.3
-
21
-
-
0000276553
-
2-path cuts for the vehicle routing problem with time windows
-
N. Kohl, J. Desrosiers, O.B.G. Madsen, M.M. Solomon, and F. Soumis 2-path cuts for the vehicle routing problem with time windows Transportation Science 33 1 1999 101 116 (Pubitemid 129723026)
-
(1999)
Transportation Science
, vol.33
, Issue.1
, pp. 101-116
-
-
Kohl, N.1
-
22
-
-
29044438268
-
Projection results for vehicle routing
-
DOI 10.1007/s10107-005-0652-x
-
A. Letchford, and J. Salazar González Projection results for vehicle routing Mathematical Programming Series B 105 2-3 2006 251 274 (Pubitemid 41788320)
-
(2006)
Mathematical Programming
, vol.105
, Issue.2-3
, pp. 251-274
-
-
Letchford, A.N.1
Salazar-Gonzalez, J.-J.2
-
23
-
-
33749124514
-
Reachability cuts for the vehicle routing problem with time windows
-
DOI 10.1016/j.ejor.2005.04.022, PII S0377221705003851
-
J. Lysgaard Reachability cuts for the vehicle routing problem with time windows European Journal of Operational Research 175 1 2006 210 223 (Pubitemid 44470717)
-
(2006)
European Journal of Operational Research
, vol.175
, Issue.1
, pp. 210-223
-
-
Lysgaard, J.1
-
24
-
-
21144444352
-
A new branch-and-cut algorithm for the capacitated vehicle routing problem
-
DOI 10.1007/s10107-003-0481-8
-
J. Lysgaard, A.N. Letchford, and R.W. Eglese A new branch-and-cut algorithm for the capacitated vehicle routing problem Mathematical Programming Series A 100 2004 423 445 (Pubitemid 40878095)
-
(2004)
Mathematical Programming
, vol.100
, Issue.2
, pp. 423-445
-
-
Lysgaard, J.1
Letchford, A.N.2
Eglese, R.W.3
-
25
-
-
26944467731
-
Branch-and-cut algorithms for the capacitated VRP
-
P. Toth, D. Vigo, SIAM Monographs on Discrete Mathematics and Applications
-
D. Naddef, and G. Rinaldi Branch-and-cut algorithms for the capacitated VRP P. Toth, D. Vigo, The Vehicle Routing Problem vol. 9 2002 SIAM Monographs on Discrete Mathematics and Applications 53 81
-
(2002)
The Vehicle Routing Problem
, vol.9
, pp. 53-81
-
-
Naddef, D.1
Rinaldi, G.2
-
27
-
-
33746329306
-
Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
-
DOI 10.1016/j.disopt.2006.05.007, PII S1572528606000417
-
G. Righini, and M. Salani Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints Discrete Optimization 3 3 2006 255 273 (Pubitemid 44118875)
-
(2006)
Discrete Optimization
, vol.3
, Issue.3
, pp. 255-273
-
-
Righini, G.1
Salani, M.2
-
28
-
-
0023313252
-
Algorithms for the vehicle routing and scheduling problem with time window constraints
-
M.M. Solomon Algorithms for the vehicle routing and scheduling problem with time window constraints Operations Research 35 1987 234 265
-
(1987)
Operations Research
, vol.35
, pp. 234-265
-
-
Solomon, M.M.1
|