-
2
-
-
0035424778
-
A unified tabu search heuristic for vehicle routing problems with time windows
-
Cordeau J-F, Laporte G and Mercier A (2001). A unified tabu search heuristic for vehicle routing problems with time windows. J Opl Res Soc 52: 928-936.
-
(2001)
J Opl Res Soc
, vol.52
, pp. 928-936
-
-
Cordeau, J.-F.1
Laporte, G.2
Mercier, A.3
-
3
-
-
0002279446
-
Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints
-
Desrochers M and Laporte G (1991). Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Opns Res Lett 10: 27-36.
-
(1991)
Opns Res Lett
, vol.10
, pp. 27-36
-
-
Desrochers, M.1
Laporte, G.2
-
4
-
-
0033166618
-
Heuristics for the traveling salesman problem with pickup and delivery
-
Gendreau M, Laporte G and Vigo D (1999). Heuristics for the traveling salesman problem with pickup and delivery. Comput Opns Res 26: 699-714.
-
(1999)
Comput Opns Res
, vol.26
, pp. 699-714
-
-
Gendreau, M.1
Laporte, G.2
Vigo, D.3
-
5
-
-
0022865373
-
Future paths for integer programming and links to artificial intelligence
-
Glover F (1986). Future paths for integer programming and links to artificial intelligence. Comput Opns Res 13: 533-549.
-
(1986)
Comput Opns Res
, vol.13
, pp. 533-549
-
-
Glover, F.1
-
6
-
-
33846683517
-
-
Gribkovskaia l, Halskau Sr Ø, Laporte G and Vlček M (2007). General solutions to the single vehicle routing problem with pickups and deliveries. Eur J Opl Res 180: 568-584.
-
Gribkovskaia l, Halskau Sr Ø, Laporte G and Vlček M (2007). General solutions to the single vehicle routing problem with pickups and deliveries. Eur J Opl Res 180: 568-584.
-
-
-
-
7
-
-
33750906954
-
Creating lasso-solutions for the traveling salesman problem with pickup and delivery by tabu search
-
Hoff A and Løkketangen A (2006). Creating lasso-solutions for the traveling salesman problem with pickup and delivery by tabu search. Central European J Opns Res 14: 125-140.
-
(2006)
Central European J Opns Res
, vol.14
, pp. 125-140
-
-
Hoff, A.1
Løkketangen, A.2
-
8
-
-
33947182306
-
Lasso solution strategies for the vehicle routing problem with pickups and deliveries
-
submitted for publication
-
Hoff A, Laporte G, Løkketangen A and Gribkovskaia I (2006). Lasso solution strategies for the vehicle routing problem with pickups and deliveries. Eur J Opl Res, submitted for publication.
-
(2006)
Eur J Opl Res
-
-
Hoff, A.1
Laporte, G.2
Løkketangen, A.3
Gribkovskaia, I.4
-
9
-
-
0017151741
-
A sequential route-building algorithm employing a generalized savings criterion
-
Mole RH and Jameson SR (1976). A sequential route-building algorithm employing a generalized savings criterion. Opl Res Quart 27: 503-511.
-
(1976)
Opl Res Quart
, vol.27
, pp. 503-511
-
-
Mole, R.H.1
Jameson, S.R.2
-
10
-
-
0000289098
-
The travelling salesman problem with pick-up and delivery
-
Mosheiov G (1994). The travelling salesman problem with pick-up and delivery. Eur J Opl Res 79: 299-310.
-
(1994)
Eur J Opl Res
, vol.79
, pp. 299-310
-
-
Mosheiov, G.1
-
11
-
-
8344236786
-
Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
-
Nagy G and Salhi S (2005). Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. Eur J Opl Res 162: 126-141.
-
(2005)
Eur J Opl Res
, vol.162
, pp. 126-141
-
-
Nagy, G.1
Salhi, S.2
-
12
-
-
0001235540
-
An analysis of several heuristics for the traveling salesman problem
-
Rosenkrantz D, Stearns R and Lewis P (1977). An analysis of several heuristics for the traveling salesman problem. SIAM J Comput 6: 563-581.
-
(1977)
SIAM J Comput
, vol.6
, pp. 563-581
-
-
Rosenkrantz, D.1
Stearns, R.2
Lewis, P.3
|