-
2
-
-
0037393086
-
A cutting plane algorithm for the capacitated arc routing problem
-
Belenger, J.M., Benavent, E. A cutting plane algorithm for the capacitated arc routing problem Computers and Operations Research : 30 (2003) 705-728
-
(2003)
Computers and Operations Research
, vol.30
, pp. 705-728
-
-
Belenger, J.M.1
Benavent, E.2
-
3
-
-
0015967553
-
Networks and vehicle routing for municipal waste collection
-
Beltrami, E., Bodin, L.: Networks and vehicle routing for municipal waste collection Networks 4:1 (1974) 65-94
-
(1974)
Networks
, vol.4
, Issue.1
, pp. 65-94
-
-
Beltrami, E.1
Bodin, L.2
-
4
-
-
21144460871
-
The capacitated arc routing problem: Lower bounds
-
Benavent, E., Campos, A., Corberán, A., Mota, E.: The capacitated arc routing problem: Lower bounds Networks 22:4 (1992) 669-690
-
(1992)
Networks
, vol.22
, Issue.4
, pp. 669-690
-
-
Benavent, E.1
Campos, A.2
Corberán, A.3
Mota, E.4
-
5
-
-
0036604749
-
-
Corberán, A., Mart?́, R., Mart?́nez, E., Soler, D.: The Rural Postman Problem on Mixed Graphs with turn penalties Computers and Operations Research 29 (2002) 887-903
-
Corberán, A., Mart?́, R., Mart?́nez, E., Soler, D.: The Rural Postman Problem on Mixed Graphs with turn penalties Computers and Operations Research 29 (2002) 887-903
-
-
-
-
6
-
-
0000496959
-
The optimum traversal of a graph
-
Christofides, N.: The optimum traversal of a graph Omega 1:6 (1973) 719-732
-
(1973)
Omega
, vol.1
, Issue.6
, pp. 719-732
-
-
Christofides, N.1
-
7
-
-
0004061426
-
Positive feedback as a search strategy
-
Technical Report 91-016, Dip. Elettronica, Politecnico di Milano, Italy
-
Dorigo, M., Maniezzo, V., Colorni, A.: Positive feedback as a search strategy. Technical Report 91-016, Dip. Elettronica, Politecnico di Milano, Italy (1991)
-
(1991)
-
-
Dorigo, M.1
Maniezzo, V.2
Colorni, A.3
-
8
-
-
0030082551
-
The Ant System: Optimization by a Colony of Cooperating Agents
-
Dorigo, M., Maniezzo, V., Colorni, A.: The Ant System: Optimization by a Colony of Cooperating Agents. IEEE Transactions on Systems, Man and Cybernetics - Part B 26:1 (1996) 29-41
-
(1996)
IEEE Transactions on Systems, Man and Cybernetics - Part B
, vol.26
, Issue.1
, pp. 29-41
-
-
Dorigo, M.1
Maniezzo, V.2
Colorni, A.3
-
10
-
-
84974701466
-
Inner city disposal of waste with ant colony optimization
-
Eds, Dorigo et al, Brussels, Belgium, September 7-9
-
Fischer, M.; Meier, B.; Teich, T.; Vogel, A.: Inner city disposal of waste with ant colony optimization. In: Proceedings of ANTS'2000 - From Ant Colonies to Artificial Ants: Second International Workshop on Ant Algorithms. Eds.: Dorigo et al., Brussels, Belgium, September 7-9 (2000) pp. 51-58.
-
(2000)
Proceedings of ANTS'2000 - From Ant Colonies to Artificial Ants: Second International Workshop on Ant Algorithms
, pp. 51-58
-
-
Fischer, M.1
Meier, B.2
Teich, T.3
Vogel, A.4
-
11
-
-
0020543990
-
Computational experiments with algorithms for a class of routing problems
-
Golden, B.L., DeArmon, J.S., Baker, E.K.: Computational experiments with algorithms for a class of routing problems Computers and Operations Research 11:1 (1983) 49-66
-
(1983)
Computers and Operations Research
, vol.11
, Issue.1
, pp. 49-66
-
-
Golden, B.L.1
DeArmon, J.S.2
Baker, E.K.3
-
13
-
-
0033718405
-
A Tabu Search heuristic for the capacitated arc routing problem
-
Hertz, A., Laporte, G., Mittaz, M.: A Tabu Search heuristic for the capacitated arc routing problem Operations Research 48:1 (2000) 129-135
-
(2000)
Operations Research
, vol.48
, Issue.1
, pp. 129-135
-
-
Hertz, A.1
Laporte, G.2
Mittaz, M.3
-
14
-
-
0003112831
-
Improvement procedures for the undirected rural postman problem
-
Hertz, A., Laporte, G., Nanchen, P.: Improvement procedures for the undirected rural postman problem INFORMS Journal of Computing 11 (1999) 53-62
-
(1999)
INFORMS Journal of Computing
, vol.11
, pp. 53-62
-
-
Hertz, A.1
Laporte, G.2
Nanchen, P.3
-
15
-
-
0001110320
-
Tour construction algorithm for the capacitated arc routing problems Asia Pacific
-
Hirabayashi, R., Saruwatari, Y., Nishida, N.: Tour construction algorithm for the capacitated arc routing problems Asia Pacific Journal of Operations Research 9:2 (1992) 155-175
-
(1992)
Journal of Operations Research
, vol.9
, Issue.2
, pp. 155-175
-
-
Hirabayashi, R.1
Saruwatari, Y.2
Nishida, N.3
-
16
-
-
84958045958
-
A genetic algorithm for the capacitated arc routing problem and its extensions, in Applications of evolutionary computing
-
Lacomme, P., Prins, C., Ramdane-Chérif, W. A genetic algorithm for the capacitated arc routing problem and its extensions, in Applications of evolutionary computing Lecture Notes in Computer Science 2037 (2001)
-
(2001)
Lecture Notes in Computer Science
, vol.2037
-
-
Lacomme, P.1
Prins, C.2
Ramdane-Chérif, W.3
-
17
-
-
84974870172
-
A branch and bound algorithm for a class of Assymmetrical Vehicle Routeing Problems
-
Laporte, G., Mercure, H., Nobert, Y.: A branch and bound algorithm for a class of Assymmetrical Vehicle Routeing Problems Journal of the Operational Research Society 43:5 (1992) 469-481
-
(1992)
Journal of the Operational Research Society
, vol.43
, Issue.5
, pp. 469-481
-
-
Laporte, G.1
Mercure, H.2
Nobert, Y.3
-
19
-
-
0025849359
-
Augment algorithms for the capacitated arc routing problem
-
Pearn, W.L. Augment algorithms for the capacitated arc routing problem Computers and Operations Research 18:2 (1991) 189-198
-
(1991)
Computers and Operations Research
, vol.18
, Issue.2
, pp. 189-198
-
-
Pearn, W.L.1
|