New lower bound for the Capacitated Arc Routing Problem

Computers and Operations Research

Volumn 33, Issue 12, 2006, Pages 3458-3472

  Wøhlk, Sanne ^a  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

Capacitated Arc Routing Problem; Lower bounds

Indexed keywords

COMPUTER SIMULATION; ROUTERS;

CAPACITATED ARC ROUTING PROBLEM; LOWER BOUNDS;

PROBLEM SOLVING;

EID: 33645155430     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.02.015     Document Type: Article

References (7)

1. B.L. Golden, and R.T. Wong Capacitated arc routing problems Networks 11 1981 305 315
2. A. Assad, B.L. Golden, and W.-L. Pearn Transforming arc routing into node routing problems Computers & Operations Research 14 4 1987 285 288
3. A.A. Assad, B.L. Golden, and W.-L. Pearn The capacitated Chinese postman problem lower bounds and solvable cases American Journal of Mathematics and Management Science 7 1,2 1987 63 88
4. W.-L. Pearn New lower bounds for the capacitated arc routing problem Networks 18 1988 181 191
5. E. Benavent, V. Campos, A. Corberan, and E. Mota The capacitated arc routing problem lower bounds Networks 22 1992 669 690
6. R. Hirabayashi, N. Nishida, and Y. Saruwatari Node duplication lower bounds for the capacitated arc routing problems Journal of the Operations Research Society of Japan 35 2 1992 119 133
7. E.K. Bakes, J.S. DeArmon, and B.L. Golden Computational experiments with algorithms for a class of routing problems Computers & Operations Research 10 1 1983 47 59