References
- Albiach J, Sanchis JM and Soler D (2006). An asymmetric TSP with time windows and with time-dependent travel times and costs: An exact solution through a graph transformation. Eur J Opl Res, doi: 10.1016/j.ejor.2006.09.099.
- ArkinEMBenderMADemaineEDFeketeSPMitchellJSBSethiaSOptimal covering tours with turn costsSiam J Comput20063553156610.1137/S0097539703434267
- Bautista J and Pereira J (2004). Ant Algorithms for Urban Waste Collection Routing. Lecture Notes in Computer Science, 3172. Springer: Berlin. pp 302—309.
- BenaventESolerDThe directed rural postman problem with turn penaltiesTransp Sci19993340841810.1287/trsc.33.4.408
- BlaisMLaporteGExact solution of the generalized routing problem through graph transformationsJ Opl Res Soc20035490691010.1057/palgrave.jors.2601590
- BodinLFaginGWelebnyRGreenbergJThe design of a computerized sanitation vehicle routing and scheduling for the town of Oyster Bay, New YorkComput Opl Res198916455410.1016/0305-0548(89)90051-8
- CarpanetoGDell'AmicoMTothPExact solution of large-scale, asymmetric traveling salesman problemsACM Trans Math Softw19952139440910.1145/212066.212081
- ChopraSRinaldiGThe graphical asymmetric traveling salesman polyhedron: Symmetric inequalitiesSIAM J Discrete Math1996960262410.1137/S089548019122232X
- ClosseyJLaporteGSorianoPSolving arc routing problems with turn penaltiesJ Opl Res Soc20015243343910.1057/palgrave.jors.2601052
- CorberánAMartíRMartínezESolerDThe rural postman problem on mixed graphs with turn penaltiesComput Opl Res20022988790310.1016/S0305-0548(00)00091-5
- CorberánARomeroASanchisJMThe mixed general routing polyhedronMath Program Ser A20039610313710.1007/s10107-003-0391-9
- CorberánAMejíaGSanchisJMNew results on the mixed general routing problemOpns Res20055336337610.1287/opre.1040.0168
- CPLEX 8.0 (2002). http://www.ilog.com/products/cplex. ILOG S.A., France.
- FischettiMTothPA polyhedral approach to the asymmetric traveling salesman problemMngt Sci1997431520153610.1287/mnsc.43.11.1520
- KwonSHKimHTKangMKDetermination of the candidate arc set for the asymmetric traveling salesman problemComput Opl Res2005321045105710.1016/j.cor.2003.09.011
- LacommePPrinsCRamadane-CherifWCompetitive memetic algorithms for arc routing problemsAnn Opl Res200413115918510.1023/B:ANOR.0000039517.35989.6d
- LacommePPrinsCRamadane-CherifWEvolutionary algorithms for periodic arc routing problemsEur J Opl Res200516553555310.1016/j.ejor.2004.04.021
- NoonCEBeanJCAn efficient transformation of the generalized traveling salesman problemINFOR1993313944
- RoySRousseauJMThe capacitated Canadian postman problemINFOR1989275873