I have been staying in Camerino, Italy for 3 months where I have visited professor Daniele Pretolani. During my stay, we developed procedures to solve the k’th shortest hyperpath problem and the bi-SBT problem. The k’th shortest hyperpath problem is solved using a new branching rule which divides the hypergraph into subhypergraphs. The bi-SBT problem is solved using different methods which are tested against each other (simple k’th method, two-phases method and k’th diagonal method). During my stay I also found a small error in the definition of a hyperpath which has been used in many papers. I therefore wrote a short note with a new definition (see publications).
Daily Archives: December 15, 2000
1 post