The capacitated m-ring-star problem

Operations Research

Volumn 55, Issue 6, 2007, Pages 1147-1162

  Baldacci, R ^a   Dell'Amico, M ^b   Gonzalez, J Salazar ^c  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF MODENA AND REGGIO EMILIA   (Italy)

^c UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

Cutting plane: branch and cut algorithm; Integer; Networks graphs: optical network design; Programming

Indexed keywords

ALGORITHMS; COST EFFECTIVENESS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; PROBLEM SOLVING;

BRANCH-AND-CUT ALGORITHMS; OPTICAL NETWORK DESIGN; REAL-WORLD INSTANCES;

FIBER OPTIC NETWORKS;

EID: 38549153862     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1070.0432     Document Type: Article

References (24)

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