Project abstract for group kawatrar

A Hop and Degree Constrained Min-Sum Arborescence Problem

These researchers have formulated the hop and degree constrained min-sum arborescence problem as an integer programming problem and have developed a three-phase heuristic to find a good solution to the problem. They are testing this heuristic on a variety of test problems to determine if it consistently gives good solutions, which necessitates use of MSI's supercomputers.

Return to this PI's main page.