The Clustered Prize-Collecting Arc Routing Problem

References

• Aráoz J., Fernández E., Meza O. An LP-based algorithm for the privatized rural postman problem. Eur. J. Oper. Res. (2008) . DOI:10.1016/j.ejor.2008.04.037Google Scholar
• Aráoz J., Fernández E., Zoltan C. The privatized rural postman problem. Comput. Oper. Res. (2006) 33:3432–3449Crossref, Google Scholar
• Aráoz J., Cunningham W., Edmonds J., Green-Krotki J. Reductions to 1-matching polyhedra. Networks (1983) 13:455–473Crossref, Google Scholar
• Aráoz J., Fernández E., Franquesa C., Meza O. Prize-collecting arc routing problems and extensions. (2006) Presentation, Third International Workshop on Freight Transportation and Logistics (Odysseus)Altea, SpainGoogle Scholar
• Barahona F., Grötschel M. On the cycle polytope of a binary matroid. J. Comb. Theory (1986) 40:40–62Crossref, Google Scholar
• Belenguer J. M., Benavent E. The capacitated arc routing problem: Valid inequalities and facets. Comput. Optim. Appl. (1998) 10:165–187Crossref, Google Scholar
• Christofides N., Campos V., Corberán A., Mota E. An algorithm for the rural postman problem. (1981) . Imperial College Report IC.O.R. 81.5, Imperial College, LondonGoogle Scholar
• Corberán A., Sanchis J. M. A polyhedral approach to the rural postman problem. Eur. J. Oper. Res. (1994) 79:95–114Crossref, Google Scholar
• Deitch R., Ladany S. P. The one-period bus routing problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm. Eur. J. Oper. Res. (2000) 127(1):69–77Crossref, Google Scholar
• Drews K. Liberalisation, privatisation and regulation in the German postal services sector. (2006) . Deliverable 1 for the Project Privatisation of Public Services and the Impact on Quality, Employment and Productivity (PIQUE) CIT5-2006-028478. Wirtschafts und Sozialwissenschaftliches Institut, Hans Böckler Stiftung, Dusseldorf, GermanyGoogle Scholar
• Dror M., Langevin A. A generalized traveling salesman problem. Transportation Sci. (1997) 31(2):187–192Link, Google Scholar
• Feillet D., Dejax P., Gendreau M. The profitable arc tour problem: Solution with a branch-and-price algorithm. Transportation Sci. (2005a) 39(4):539–552Link, Google Scholar
• Feillet D., Dejax P., Gendreau M. Traveling salesman problems with profits: An overview. Transportation Sci. (2005b) 39(2):188–205Link, Google Scholar
• Fernández E., Meza O., Garfinkel R., Ortega M. On the undirected rural postman problem: Tight bounds based on a new formulation. Oper. Res. (2003) 51:281–291Link, Google Scholar
• Franquesa C. Clustered price-collecting arc routing problems. (2008) . Unpublished doctoral dissertation, Technical University of Catalonia, Barcelona, SpainGoogle Scholar
• Grötschel M., Holland O. A cutting plane algorithm for minimum perfect 2-matchings. Computing (1987) 39:327–344Crossref, Google Scholar
• Hertz A. G., Laporte P., Nanchen-Hugo H. Improvement procedures for the undirected rural postman problem. INFORMS J. Comput. (1999) 1:53–62Link, Google Scholar
• ILOGUsing the CPLEX Callable Library (2000) 7th ed.(ILOG, Inc. CPLEX Division, Incline Village) Google Scholar
• Lenstra J. K., Rinnooy Kan A. H. G. On general routing problem. Networks (1976) 6:273–280Crossref, Google Scholar
• Letchford A. N., Reinelt G., Theis D. O. Odd minimum cut-sets and b-matchings revisited. SIAM J. Discrete Math. (2008) 22:1480–1487Crossref, Google Scholar
• Minnesota House of Representatives Solid waste management in Minnesota—House Research. . Accessed October 2008, http://www.house.leg.state.mn.us/hrd/issinfo/sssolwast.htmGoogle Scholar
• Waste Electrical and Electronic Equipment (WEEE) Directive 2002/96/EC of the European Parliament and of the Council of 27 January 2003 on WEEE. . Accessed October 2008, http://ec.europa.eu/environment/waste/weee/index_on.htmGoogle Scholar