The Capacitated m-Ring-Star Problem

References

• Araque J. R., Kudva G., Morin T. L., Pekny J. F. A branch-and-cut algorithm for vehicle routing problems. Ann. Oper. Res. (1994) 50:37–59Crossref, Google Scholar
• Augerat P., Belenguer J. M., Benavent E., Corberán A., Naddef D. Separating capacity constraints in the CVRP using tabu search. Eur. J. Oper. Res. (1988) 106:546–557Crossref, Google Scholar
• Augerat P., Belenguer J. M., Benavent E., Corberán A., Naddef D., Rinaldi G. Computational results with a branch and cut code for the capacitated vehicle routing problem. (1995) . Technical Report RR 949-M, Université Joseph Fourier, Grenoble, FranceGoogle Scholar
• Baldacci R., Dell'Amico M. Heuristic algorithms for the design of urban optical networks. (2004) . Technical Report 63, Department of Sciences and Methods for Engineering, University of Modena and Reggio Emilia, Reggio Emilia, ItalyGoogle Scholar
• Baldacci R., Hadjiconstantinou E., Mingozzi A. An exact algorithm for the traveling salesman problem with deliveries and collections. Networks (2003) 42:26–41Crossref, Google Scholar
• Baldacci R., Hadjiconstantinou E., Mingozzi A. An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Oper. Res. (2004) 52:723–738Link, Google Scholar
• Beasley J. E., Nascimento E. M. The vehicle routing-allocation problem: A unifying framework. Trabajos de OPerativa (1996) 4:65–86Google Scholar
• Finke G., Claus A., Gunn E. A two-commodity network flow approach to the traveling salesman problem. Congressus Numernatium (1984) 41:167–178Google Scholar
• Gavish B., Graves S. The traveling salesman problem and related problems. (1979) . Technical report, Graduate School of Management, University of Rochester, Rochester, New YorkGoogle Scholar
• Gourdin E., Labbé M., Yaman H., Drezner Z., Hamacher H. W. Telecommunication and location. Facility Location: Applications and Theory (2002) (Springer, Berlin, Germany) Crossref, Google Scholar
• Gouveia L. A result on projection for the vehicle routing problem. Eur. J. Oper. Res. (1995) 85:610–624Crossref, Google Scholar
• ILOG CPLEXILOG CPLEX 8.1 Advanced Reference Manual (2003) . ILOG S.A., FranceGoogle Scholar
• Labbé M., Laporte G., Martín I. Rodríguez, Crainic T. G., Laporte G. Path, tree and cycle location. Fleet Management and Logistics (2002) (Kluwer, Boston, MA) 187–204Google Scholar
• Labbé M., Laporte G., Martín I. Rodríguez, González J. J. Salazar. The ring star problem: Polyhedral analysis and exact algorithm. Networks (2004) 43:177–189Crossref, Google Scholar
• Labbé M., Laporte G., Martín I. Rodríguez, González J. J. Salazar. Locating median cycles in networks. Eur. J. Oper. Res. (2005) 160:457–470Crossref, Google Scholar
• Lee Y., Chiu S. Y., Sanchez J. A branch and cut algorithm for the Steiner ring star problem. Internat. J. Management Sci. (1998) 4:21–34Google Scholar
• Letchford A. N., González J. J. Salazar. Projection results for vehicle routing. Math. Programming Ser. B (2006) 105:251–274Crossref, Google Scholar
• Letchford A. N., Eglese R. W., Lysgaard J. Multistars, partial multistars and the capacitated vehicle routing problem. Math. Programming (2002) 94:21–40Crossref, Google Scholar
• Lucena A. Exact solution approaches for the vehicle routing problem. (1986) . Ph.D. thesis, Department of Management Science, Imperial College, London, UKGoogle Scholar
• Naddef D., Rinaldi G., Toth P., Vigo D. Branch-and-cut algorithms for the capacitated VRP. The Vehicle Routing Problem (2002) 9(SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, PA) 53–81Crossref, Google Scholar
• Ralphs T. K., Kopman L., Pulleyblank W. R., Trotter L. E. On the capacitated vehicle routing problem. Math. Programming Ser. B (2003) 94:343–359Crossref, Google Scholar
• Reinelt G. TSPLIB—A traveling salesman problem library. ORSA J. Comput. (1991) 3:376–384Link, Google Scholar
• Toth P., Vigo D.The Vehicle Routing Problem (2002) 9(SIAM, Philadelphia, PA) . SIAM Monographs on Discrete Mathematics and ApplicationsCrossref, Google Scholar
• Xu J., Chiu S. Y., Glover F. Optimizing a ring-based private line telecommunication network using tabu search. Management Sci. (1999) 45:330–345Link, Google Scholar