-
1
-
-
36348942008
-
-
D. Appelgate, R. Bixby, V. Chvátal, and, W. Cook, Concorde tsp solver (2003), available online at:.
-
(2003)
Concorde Tsp Solver
-
-
Appelgate, D.1
Bixby, R.2
Chvátal, V.3
Cook, W.4
-
2
-
-
51349124105
-
An additive branch-and-bound algorithm for the pickup and delivery traveling salesman problem with lifo or fifo loading
-
F. Carrabs, R. Cerulli, and, J.-F. Cordeau, An additive branch-and-bound algorithm for the pickup and delivery traveling salesman problem with lifo or fifo loading, INFOR Inform Syst Oper Res 45 (2007), 223-238.
-
(2007)
INFOR Inform Syst Oper Res
, vol.45
, pp. 223-238
-
-
Carrabs, F.1
Cerulli, R.2
Cordeau, J.-F.3
-
3
-
-
73849105288
-
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with lifo loading
-
J.-F. Cordeau, M. Iori, G. Laporte, and, J. J. Salazar-González, A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with lifo loading, Networks 55 (2010), 46-59.
-
(2010)
Networks
, vol.55
, pp. 46-59
-
-
Cordeau, J.-F.1
Iori, M.2
Laporte, G.3
Salazar-González, J.J.4
-
4
-
-
0004116989
-
-
second edition, MIT Press.
-
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and, C. Stein, Introduction to algorithms, second edition, MIT Press, 2001.
-
(2001)
Introduction to Algorithms
-
-
Cormen, T.H.1
Leiserson, C.E.2
Rivest, R.L.3
Stein, C.4
-
5
-
-
64549097583
-
The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
-
A. Felipe, M. Ortuño, and, G. Tirado, The double traveling salesman problem with multiple stacks: A variable neighborhood search approach, Comput Oper Res, Cambridge, Massachusetts 36 (2009), 2983-2993.
-
(2009)
Comput Oper Res, Cambridge, Massachusetts
, vol.36
, pp. 2983-2993
-
-
Felipe, A.1
Ortuño, M.2
Tirado, G.3
-
6
-
-
67349142625
-
New neighborhood structures for the double traveling salesman problem with multiple stacks
-
A. Felipe, M. Ortuño, and, G. Tirado, New neighborhood structures for the double traveling salesman problem with multiple stacks, TOP 17 (2009), 190-213.
-
(2009)
TOP
, vol.17
, pp. 190-213
-
-
Felipe, A.1
Ortuño, M.2
Tirado, G.3
-
7
-
-
0001185362
-
K best solutions to combinatorial optimization problems
-
H. W. Hamacher, and, M. Queyranne, K best solutions to combinatorial optimization problems, Ann Oper Res 4 (1985), 123-143.
-
(1985)
Ann Oper Res
, vol.4
, pp. 123-143
-
-
Hamacher, H.W.1
Queyranne, M.2
-
8
-
-
0000685484
-
A procedure for computing the K best solutions to discrete optimization problems and its application to the shortest path problem
-
E. Lawler, A procedure for computing the K best solutions to discrete optimization problems and its application to the shortest path problem, Manag Sci 18 (1972), 401-405.
-
(1972)
Manag Sci
, vol.18
, pp. 401-405
-
-
Lawler, E.1
-
9
-
-
80755165459
-
An exact method for the double tsp with multiple stacks
-
R. M. Lusby, J. Larsen, M. Ehrgott, and, D. Ryan, An exact method for the double tsp with multiple stacks, Int Trans Oper Res 17 (2010), 637-652.
-
(2010)
Int Trans Oper Res
, vol.17
, pp. 637-652
-
-
Lusby, R.M.1
Larsen, J.2
Ehrgott, M.3
Ryan, D.4
-
11
-
-
62549093551
-
The double travelling salesman problem with multiple stacks - Formulation and heuristic solution approaches
-
H. L. Petersen, and, O. B. G. Madsen, The double travelling salesman problem with multiple stacks-formulation and heuristic solution approaches, Eur J Oper Res 198 (2009), 139-147.
-
(2009)
Eur J Oper Res
, vol.198
, pp. 139-147
-
-
Petersen, H.L.1
Madsen, O.B.G.2
|