@techreport{TR-IC-10-15,
   number = {IC-10-15},
   author = {Edna A. {Hoshino} and Cid C. {de Souza}},
   title  =  {{A Branch-and-Cut-and-Price Approach for the Capacitated
                   $m$-Ring-Star Problem}},
   month = {May},
   year = {2010},
   institution = {Institute of Computing, University of Campinas},
   note = {In English, 22 pages.
    \par\selectlanguage{english}\textbf{Abstract}
       The  Capacitated  $m$-ring-star  Problem  is  a  variant of the
       classical  one-depot  capacitated  vehicle  routing  problem in
       which  a  customer  is  either  on  a  route or is connected to
       another  customer  or to some Steiner point present in a route.
       We  develop  a  new  exact  algorithm  for this problem using a
       branch-and-cut-and-price  approach  and compare its performance
       with that of a branch-and-cut algorithm proposed earlier in the
       literature.  Computational  results show that the new algorithm
       outperforms the branch-and-cut one in many instance classes.
  }
}