-
1
-
-
84986942507
-
A set-partitioning-based exact algorithm for the vehicle routing problem
-
Y. Agarwal, K. Mathur, and H.M. Salkin A set-partitioning-based exact algorithm for the vehicle routing problem Networks 19 1989 731 749
-
(1989)
Networks
, vol.19
, pp. 731-749
-
-
Agarwal, Y.1
Mathur, K.2
Salkin, H.M.3
-
3
-
-
85043071526
-
The split delivery capacitated team orienteering problem
-
Università degli Studi di Brescia, Italy
-
C. Archetti, N. Bianchessi, A. Hertz, M.G. Speranza, The split delivery capacitated team orienteering problem, Quaderno di Ricerca n. 349, Dipartimento Metodi Quantitativi, Università degli Studi di Brescia, Italy, 2010.
-
(2010)
Quaderno di Ricerca N. 349, Dipartimento Metodi Quantitativi
-
-
Archetti, C.1
Bianchessi, N.2
Hertz, A.3
Speranza, M.G.4
-
4
-
-
80755188983
-
A column generation approach for the split delivery vehicle routing problem
-
C. Archetti, N. Bianchessi, and M.G. Speranza A column generation approach for the split delivery vehicle routing problem Networks 58 4 2011 241 254
-
(2011)
Networks
, vol.58
, Issue.4
, pp. 241-254
-
-
Archetti, C.1
Bianchessi, N.2
Speranza, M.G.3
-
5
-
-
0000816725
-
Branch-and-price: Column generation for solving huge integer programs
-
C. Barnhart, E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh, and P.H. Vance Branch-and-price: column generation for solving huge integer programs Operations Research 46 1998 316 329
-
(1998)
Operations Research
, vol.46
, pp. 316-329
-
-
Barnhart, C.1
Johnson, E.L.2
Nemhauser, G.L.3
Savelsbergh, M.W.P.4
Vance, P.H.5
-
6
-
-
84986992097
-
An algorithm for the resource constrained shortest path problem
-
J. Beasley, and N. Christofides An algorithm for the resource constrained shortest path problem Networks 19 1989 379 394
-
(1989)
Networks
, vol.19
, pp. 379-394
-
-
Beasley, J.1
Christofides, N.2
-
8
-
-
84872987383
-
Heuristic branch-and-price-and-cut to solve a network design problem
-
Montréal Canada
-
A. Chabrier Heuristic branch-and-price-and-cut to solve a network design problem Proceedings CPAIOR 2003 Montréal Canada
-
(2003)
Proceedings CPAIOR
-
-
Chabrier, A.1
-
9
-
-
0001208905
-
The vehicle routing problem
-
N. Christofides, A. Mingozzi, P. Toth, C. Sandi, Wiley Chichester
-
N. Christofides, A. Mingozzi, and P. Toth The vehicle routing problem N. Christofides, A. Mingozzi, P. Toth, C. Sandi, Combinatorial Optimization 1979 Wiley Chichester 315 338
-
(1979)
Combinatorial Optimization
, pp. 315-338
-
-
Christofides, N.1
Mingozzi, A.2
Toth, P.3
-
10
-
-
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 1992 342 354
-
(1992)
Operations Research
, vol.40
, pp. 342-354
-
-
Desrochers, M.1
Desrosiers, J.2
Solomon, M.3
-
12
-
-
77954894235
-
Column generation based primal heuristics
-
C. Joncour, S. Michel, R. Sadykov, D. Sverdlov, and F. Vanderbeck Column generation based primal heuristics Electronic Notes in Discrete Mathematics 36 2010 695 702
-
(2010)
Electronic Notes in Discrete Mathematics
, vol.36
, pp. 695-702
-
-
Joncour, C.1
Michel, S.2
Sadykov, R.3
Sverdlov, D.4
Vanderbeck, F.5
-
13
-
-
33746329306
-
Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
-
G. Righini, and M. Salani Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints Discrete Optimization 3 2006 255 273
-
(2006)
Discrete Optimization
, vol.3
, pp. 255-273
-
-
Righini, G.1
Salani, M.2
-
14
-
-
51349129806
-
New dynamic programming algorithms for the resource constrained shortest path problem
-
G. Righini, and M. Salani New dynamic programming algorithms for the resource constrained shortest path problem Networks 51 2008 155 170
-
(2008)
Networks
, vol.51
, pp. 155-170
-
-
Righini, G.1
Salani, M.2
-
16
-
-
0033725783
-
On dantzig-wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm
-
F. Vanderbeck On dantzig-wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm Operations Research 40 2000 111 128
-
(2000)
Operations Research
, vol.40
, pp. 111-128
-
-
Vanderbeck, F.1
|