-
1
-
-
76749148362
-
Scip: Solving constraint integer programs
-
T. Achterberg Scip: solving constraint integer programs Mathematical Programming Computation 1 1 2009 1 41 http://mpc.zib.de/index.php/MPC/article/ view/4
-
(2009)
Mathematical Programming Computation
, vol.1
, Issue.1
, pp. 1-41
-
-
Achterberg, T.1
-
2
-
-
81455135706
-
New route relaxation and pricing strategies for the vehicle routing problem
-
R. Baldacci, A. Mingozzi, and R. Roberti New route relaxation and pricing strategies for the vehicle routing problem Operations Research 59 2011 1269 1283
-
(2011)
Operations Research
, vol.59
, pp. 1269-1283
-
-
Baldacci, R.1
Mingozzi, A.2
Roberti, R.3
-
3
-
-
81455141797
-
An exact method for the capacitated location-routing problem
-
R. Baldacci, A. Mingozzi, and R. Wolfler-Calvo An exact method for the capacitated location-routing problem Operations Research 59 2011 1284 1296
-
(2011)
Operations Research
, vol.59
, pp. 1284-1296
-
-
Baldacci, R.1
Mingozzi, A.2
Wolfler-Calvo, R.3
-
4
-
-
78549293214
-
A branch-and-cut algorithm for the capacitated location routing problem
-
J.M. Belenguer, E. Benavent, C. Prins, C. Prodhon, and R. Wolfler-Calvo A branch-and-cut algorithm for the capacitated location routing problem Computers and Operations Research 38 2011 931 941
-
(2011)
Computers and Operations Research
, vol.38
, pp. 931-941
-
-
Belenguer, J.M.1
Benavent, E.2
Prins, C.3
Prodhon, C.4
Wolfler-Calvo, R.5
-
5
-
-
79955967127
-
A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows
-
A. Bettinelli, A. Ceselli, and G. Righini A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows Transportation Research Part C: Emerging Technologies 19 5 2011 723 740
-
(2011)
Transportation Research Part C: Emerging Technologies
, vol.19
, Issue.5
, pp. 723-740
-
-
Bettinelli, A.1
Ceselli, A.2
Righini, G.3
-
7
-
-
84893787049
-
Modeling and solving profitable location and distribution problems
-
in press (available online)
-
A. Ceselli, G. Righini, and E. Tresoldi Modeling and solving profitable location and distribution problems Optimization Letters 2012 in press (available online)
-
(2012)
Optimization Letters
-
-
Ceselli, A.1
Righini, G.2
Tresoldi, E.3
-
10
-
-
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 2008 387 404
-
(2008)
Transportation Science
, vol.42
, pp. 387-404
-
-
Desaulniers, G.1
Lessard, F.2
Hadjar, A.3
-
12
-
-
4644250559
-
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
-
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 3 2004 216 229
-
(2004)
Networks
, vol.44
, Issue.3
, pp. 216-229
-
-
Feillet, D.1
Dejax, P.2
Gendreau, M.3
Gueguen, C.4
-
13
-
-
33748591592
-
The shortest path problem with resource constraints and k-cycle elimination for k = 3
-
S. Irnich, and D. Villeneuve The shortest path problem with resource constraints and k-cycle elimination for k = 3 INFORMS Journal on Computing 18 2006 391 406
-
(2006)
INFORMS Journal on Computing
, vol.18
, pp. 391-406
-
-
Irnich, S.1
Villeneuve, D.2
-
14
-
-
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
-
15
-
-
0000276553
-
2-path cuts for the vehicle routing problem with time windows
-
N. Kohl, J. Desrosiers, O. Madsen, M. Solomon, and F. Soumis 2-path cuts for the vehicle routing problem with time windows Transportation Science 33 1999 101 116
-
(1999)
Transportation Science
, vol.33
, pp. 101-116
-
-
Kohl, N.1
Desrosiers, J.2
Madsen, O.3
Solomon, M.4
Soumis, F.5
-
16
-
-
84959058447
-
-
Lecture Notes in Computer Science Springer Chapter branch, cut, and price: sequential and parallel
-
L. Ladányi, T.K. Ralphs, and L.E. Trotter Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions Lecture Notes in Computer Science vol. 2241 2001 Springer 223 260 Chapter branch, cut, and price: sequential and parallel
-
(2001)
Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions
, vol.2241 VOL.
, pp. 223-260
-
-
Ladányi, L.1
Ralphs, T.K.2
Trotter, L.E.3
-
19
-
-
51349129806
-
New dynamic programming algorithms for the resource constrained elementary shortest path problem
-
G. Righini, and M. Salani New dynamic programming algorithms for the resource constrained elementary shortest path problem Networks 51 3 2008 155 170
-
(2008)
Networks
, vol.51
, Issue.3
, pp. 155-170
-
-
Righini, G.1
Salani, M.2
-
20
-
-
71949099703
-
A two-stage vehicle routing model for large-scale bioterrorism emergencies
-
Z. Shen, F. Ordonez, and M. Dessouky A two-stage vehicle routing model for large-scale bioterrorism emergencies Networks 54 4 2009 255 269
-
(2009)
Networks
, vol.54
, Issue.4
, pp. 255-269
-
-
Shen, Z.1
Ordonez, F.2
Dessouky, M.3
|