References
- Aldaeeb , W. 1999 . Scheduling with time dependent processing time: Review and extensions . J. Oper. Res. Soc. , 50 : 711 – 720 .
- Alfred , V. A. , Anton , T. and David , L. 1991 . An optimization technique for protocol conformance test generation based on UIO sequences and rural Chinese postman tours . IEEE Trans. Commun. , 39 : 1604 – 1615 . (doi:10.1109/26.111442)
- Bang , J. and Gutin , G. 2001 . Digraphs: Theory, Algorithms and Applications , London : Springer .
- Chi , C. and Hao , R. 2007 . Test generation for interaction detection in feature-rich communication systems . Comput. Netw. , 51 : 426 – 436 . (doi:10.1016/j.comnet.2006.08.015)
- Corberan , A. , Romero , A. and Sanchis , J. M. 2003 . The mixed general routing polyhedron . Math. Program. , 96 : 103 – 137 . (doi:10.1007/s10107-003-0391-9)
- Corberan , A. , Mejia , G. and Sanchis , J. M. 2005 . New results on the mixed general routing problem . Oper. Res. , 52 : 363 – 376 . (doi:10.1287/opre.1040.0168)
- Dror , M. 2000 . Arc Routing: Theory, Solutions and Applications , Boston : Kluwer Academic .
- Edmonds , J. and Johnson , E. L. 1973 . Matching, euler tours and the chinese postman . Math. Program. , 5 : 88 – 124 . (doi:10.1007/BF01580113)
- Eiselt , H. A. , Gendreau , M. and Laporte , G. 1995 . Arc routing problems, part I: The Chinese postman problem . Oper. Res. , 43 : 231 – 242 . (doi:10.1287/opre.43.2.231)
- Eiselt , H. A. , Gendreau , M. and Laporte , G. 1995 . Arc routing problems, part II: The rural postman problem . Oper. Res. , 42 : 399 – 414 . (doi:10.1287/opre.43.3.399)
- Ghiani , G. and Laporte , G. 2000 . A branch-and-cut algorithm for the undirected rural postman problem . Math. Program. , 87 : 467 – 481 . (doi:10.1007/s101070050007)
- Grotschel , M. and Padberg , M. W. 1985 . “ Polyhedral theory ” . In The Traveling Salesman Problem , Edited by: Lawler , E. L. , Lenstra , J. K. , Rinooy Kan , A. H.G. and Shmoys , D. 251 – 306 . New York : Wiley .
- Grótschel , M. and Win , Z. 1992 . A cutting plane algorithm for the windy postman problem . Math. Program. , 55 : 339 – 358 . (doi:10.1007/BF01581206)
- Guan , M. G. 1962 . Programming using odd and even points . Chinese Math. , 1 : 273 – 277 .
- Hashimoto , H. , Yagiura , M. and Ibaraki , T. 2008 . An iterated local search algorithm for the time dependent vehicle routing problem with time windows . Discrete Optim. , 5 : 434 – 456 . (doi:10.1016/j.disopt.2007.05.004)
- Lai , R. 2002 . A survey of communication protocol testing . J. Syst. Softw. , 62 : 21 – 46 . (doi:10.1016/S0164-1212(01)00132-7)
- Laporte , G. 1997 . Modeling and solving several classes of arc routing problems as traveling salesman problems . Comput. Oper. Res. , 24 : 1057 – 1061 . (doi:10.1016/S0305-0548(97)00013-0)
- Longo , H. , Aragäo , M. P. and Uchoa , E. 2006 . Solving capacitated arc routing problems using a transformation to the CVRP . Comput. Oper. Res. , 33 : 1823 – 1837 . (doi:10.1016/j.cor.2004.11.020)
- Malandraki , C. and Daskin , M. S. 1992 . Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms . Transp. Sci. , 26 : 185 – 200 . (doi:10.1287/trsc.26.3.185)
- Mullaseril , P. A. 1996 . “ Capacitated rural postman problem with time windows and split delivery ” . University of Arizona . Ph.D. thesis
- Nobert , Y. and Picard , J. C. 1996 . An optimal algorithm for the mixed Chinese postman problem . Networks , 27 : 95 – 108 . (doi:10.1002/(SICI)1097-0037(199603)27:2<97::AID-NET1>3.0.CO;2-8)
- Orda , A. and Rom , R. 1990 . Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length . J. ACM , 37 : 607 – 625 . (doi:10.1145/79147.214078)
- Pearn , W. L. , Assad , A. and Golden , B. L. 1987 . Transforming arc routing into node routing problems . Comput. Oper. Res. , 14 : 285 – 288 . (doi:10.1016/0305-0548(87)90065-7)
- Sundararaghavan , P. S. and Kunnathur , A. S. 1994 . Single machine scheduling with start time dependent processing time: Some solvable cases . European J. Oper. Res. , 78 : 394 – 403 . (doi:10.1016/0377-2217(94)90048-5)
- Tagmouti , M. , Gendreau , M. and Potvin , J. Y. 2007 . Arc routing problems with time-dependent service costs . European J. Oper. Res. , 181 : 30 – 39 . (doi:10.1016/j.ejor.2006.06.028)
- Yannakakis , M. Testing, optimization, and games . Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science . Vol. 1 , pp. 78 – 88 .