The Arc Routing and Scheduling Problem with Transshipment

References

• Belenguer J. M., Benavent E. The capacitated arc routing problem: Valid inequalities and facets. Comput. Optim. Appl. (1998) 10:165–187Crossref, Google Scholar
• Benavent E., Campos V., Corberan A., Mota E. The capacitated arc routing problem: Lower bounds. Networks (1992) 22:669–690Crossref, Google Scholar
• Corberan A., Sanchis J. M. A polyhedral approach to the rural postman problem. Eur. J. Oper. Res. (1994) 79:95–114Crossref, Google Scholar
• Dearmon J. A comparison of heuristics for the capacitated Chinese postman problem. (1981) . Master's thesis University of Maryland, College Park, MDGoogle Scholar
• Eiselt H. A., Gendreau M., Laporte G. Arc routing problems, Part 2: The rural postman problem. Oper. Res. (1995) 43(3):399–414Link, Google Scholar
• Frederickson G. N., Hecht M. S., Kim C. E. Approximation algorithms for some routing problems. SIAM J. Comput. (1978) 7(2):178–193Crossref, Google Scholar
• Gendreau M., Hertz A., Laporte G. A Tabu search heuristic for the vehicle routing problem. Management Sci. (1994) 40(10):1276–1290Link, Google Scholar
• Ghiani G., Improta G., Laporte G. The capacitated arc routing problem with intermediate facilities. Networks (2001) 37(3):134–143Crossref, Google Scholar
• Ghiani G., Guerriero F., Improta G., Laporte G., Musmanno R. The arc routing problem with intermediate facilities under capacity and distance restrictions. (2000) . Technical report, PARCOLAB, Università della Calabria, Cosenza, Italy, submitted for publicationGoogle Scholar
• Glover F., Laguna M.Tabu Search (1997) (Kluwer Academic Publishers, New York) Crossref, Google Scholar
• Golden B. L., Wong R. T. Capacitated arc routing problems. Networks (1981) 11:305–315Crossref, Google Scholar
• Hertz A., Laporte G., Mittaz M. A Tabu search heuristic for the capacitated arc routing problem. Oper. Res. (2000) 48(1):129–135Link, Google Scholar
• Hertz A., Laporte G., Nanchen-Hugo P. Improvement procedures for the undirected rural postman problem. INFORMS J. Comput. (1999) 11:53–62Link, Google Scholar
• Kirca O., Erkip N. Selecting transfer station locations for large solid waste systems. Eur. J. Oper. Res. (1988) 35:339–349Crossref, Google Scholar
• Martello S., Toth P. Lower bounds and reduction procedures for the bin-packing problem. Discrete Appl. Math. (1990) 26:59–70Crossref, Google Scholar
• Padberg M. W., Rao M. R. Odd minimum cut-sets and b-matchings. Math. of Oper. Res. (1982) 7:67–80Link, Google Scholar
• Rochat Y., Taillard E. D. Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics (1995) 1:147–167Crossref, Google Scholar
• Wirasinghe S. C., Waters N. M. An approximate procedure for determining the number, capacities and locations of solid waste transfer-stations in an urban region. Eur. J. of Oper. Res. (1983) 12:105–111Crossref, Google Scholar