An exact algorithm for solving the ring star problem

Optimization

Volumn 59, Issue 1, 2010, Pages 125-140

  Kedad Sidhoum, Safia ^a   Nguyen, Viet Hung ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Branch and cut; Mixed integer programming; Network design; Polyhedral analysis

Indexed keywords

EID: 76649086396     PISSN: 02331934     EISSN: 10294945     Source Type: Journal    
DOI: 10.1080/02331930903500332     Document Type: Article

References (9)

1. R. Baldacci, M. Dell'Amico, and J.J. Salazar Gonzalez, The capacitated m-ring-star problem, Oper. Res. 55 (2007), pp. 1147-1162.
2. P. Bauer, The circuit polytope: Facets, Math. Oper. Res. 22 (1997), pp. 110-145.
3. M. Labbé, G. Laporte, and I. Rodriguez Martin, Path, Tree and Cycle Location, Kluwer, Boston, MA, 2002, pp. 187-204.
4. M. Labbé, G. Laporte, I. Rodriguez Martin, and J.J. Salazar Gonzalez, The ring star problem: Polyhedral analysis and exact algorithm, Networks 43 (2004), pp. 177-189.
5. M. Labbé, G. Laporte, I. Rodriguez Martin, and J.J. Salazar Gonzalez, Locating median cycles in networks, Eur. J. Oper. Res. 160 (2005), pp. 457-470.
6. A. Letchford, G. Reinelt, and D.O. Theis, A faster exact separation algorithm for blossom inequalities, in Integer Programming and Combinatorial Optimization 10. Lecture Notes in Computer Science, Vol. 3064, Springer, Berlin, 2004.
7. A. Letchford, G. Reinelt, and D.O. Theis, Odd minimum cut-sets and b-matchings revisited, SIAM J. Discrete Math. 22 (2008), pp. 1480-1487.
8. J.A. Moreno Pérez, J.M. Moreno-Vega, and I. Rodriguez Martin, Variable neighborhood tabu search and its application to the median cycle problem, Eur. J. Oper. Res. 151 (2003), pp. 365-378.
9. M.W. Padberg and M.R. Rao, Odd minimum cut-sets and b-matchings, Math. Oper. Res. 7 (1982), pp. 67-80.