The ring star problem: Polyhedral analysis and exact algorithm

Networks

Volumn 43, Issue 3, 2004, Pages 177-189

  Labbé, Martine ^a   Laporte, Gilbert ^b   Martín, Inmaculada Rodríguez ^c   González, Juan José Salazar ^c  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b HEC MONTRÉAL   (Canada)

^c UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

Branch and cut; Median cycle; Telecommunications

Indexed keywords

ALGORITHMS; DIGITAL STORAGE; HEURISTIC PROGRAMMING; HIERARCHICAL SYSTEMS; INTERNET; MULTILAYERS; PROBLEM SOLVING; SET THEORY; VECTORS;

MEDIAN CYCLE; POLYHEDRAL ANALYSIS; RING STAR PROBLEM;

TELECOMMUNICATION NETWORKS;

EID: 2542601639     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10114     Document Type: Article

References (18)

1. P. Avella and A. Sassano, On the p-median polytope, Math Program A 89 (2001), 395-411.
2. P. Bauer, The circuit polytope: Facets, Math Oper Res 22 (1997), 110-145.
3. T. Christof and A. Loebel, POlyhedron Representation Transformation Algorithm (PORTA), http://www.iwr.uniheidelberg.de/groups/comopt/software/PORTA.
4. L. Cooper, Location-allocation problems, Oper Res 11 (1963), 331-343.
5. J.R. Current and D.A. Schilling, The median tour and maximal covering tour problems: Formulation and heuristics, Eur J Oper Res 73 (1994), 114-126.
6. M. Fischetti, J.J. Salazar, and P. Toth, A branch-and-cut algorithm for the symmetric generalized traveling salesman problem, Oper Res 45 (1997), 378-394.
7. M. Gendreau, G. Laporte, and F. Semet, The covering tour problem, Oper Res 45 (1997), 568-576.
8. E. Gourdin, M. Labbé, and H. Yaman, "Telecommunication and location," Facility location: Applications and theory, Z. Drezner and H.W. Harnacher (Editors), Springer, Berlin, (to appear).
9. M. Grótschel and M.W. Padberg., "Polyhedral theory," The traveling salesman problem: A guided tour of combinatorial optimization, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys (Editors), Wiley, Chichester, 1995, pp. 251-305.
10. M. Jünger and S. Thienel, Introduction to ABACUS - A Branch-And-CUt System, Technical report No. 97.263, Universitat zu Köln, 1997.
11. J.G. Klincewicz, Hub location in backbone/tributary network design: A review, Loc Sci 6 (1998), 307-335.
12. M. Labbé, G. Laporte, and I. Rodríguez Martín, "Path, tree and cycle location," Fleet management and logistics, T.G. Crainic and G. Laporte (Editors), Kluwer, Boston, 1998, pp. 187-204.
13. Y. Lee, S.Y. Chiu, and J. Sanchez, A branch and cut algorithm for the Steiner ring star problem, Int J Manag Sci 4 (1998), 21-34.
14. J.A. Moreno Pérez, J.M. Moreno Vega, and I. Rodríguez Martín, Variable neighborhood tabu search and its application to the median cycle problem, Eur J Oper Res (to appear).
15. M.W. Padberg, On the facial structure of set packing polyhedra, Math Program 5 (1973), 199-215.
16. G. Reinelt, TSPLIB - A traveling salesman problem library, ORSA J Comput 3 (1991), 376-384.
17. I. Rodríguez Martín, Cycle location problems, Ph.D. thesis, University of La Laguna, 2000.
18. J. Xu, S.Y. Chiu, and F. Glover, Optimizing a ring-based private line telecommunication network using tabu search, Manag Sci 45 (1999), 330-345.