XPost: sci.op-research   
   From: fabrizio.riguzziREMOVE@unife.it   
      
   Hello,   
   	I would like to know if the following problem has already been studied:   
   I have two rulers of equal length, each cut into pieces of (typically of   
   different length and not necessarily  in the same number for the two   
   rulers). I would like to find a way of dividing the pieces of one ruler   
   so that the new pieces can be combined to give the pieces of the other   
   ruler. The division must be such that it is not dominated, i.e., no two   
   pieces can be attached and the resulting division be still a solution of   
   the problem. I may also want to find all the possible non dominated   
   solutions.   
      
   Is there a nmae for this problem? Is there an algorithm that solves it?   
      
   Thanks,   
   Best,   
   Fabrizio   
      
   [ comp.ai is moderated ... your article may take a while to appear. ]   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)