From: dawenliu@hotmail.com   
      
   I have 2n vertices, n for group A, n for group B.   
   The vertices are fully connected by edges, each edge has a different   
   weight.   
   What I want to solve is this:   
   Go trough all vertices, without repetition, and minimize the sum of   
   weights, under this rule:   
      
   ... -A-A-B-B-A-A-B-B-A-A-B-B-...   
      
   where A represents some vertex of A.   
   This is different than "Bipartite TSP", which is ...-A-B-A-B-A-...   
      
   Can anyone tell me if there are algorithms to solve my problem?   
   Thanks a lot!!   
      
   [ comp.ai is moderated.  To submit, just post and be patient, or if ]   
   [ that fails mail your article to , and ]   
   [ ask your news administrator to fix the problems with your system. ]   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)