ACES Trainee Presentation to the ACES Visiting Committee
Thomas Vitolo
Manufacturing Engineering - Boston University
Friday - November 30, 2007
Physics Research Building - Room 595

"Finding Minimum Spanning Trees in Sparsely Connected Graphs"

Degree constrained spanning tree requirements commonly appear in network architecture problems. I propose a integer linear programming based approach for spanning tree problems on incomplete graphs with heterogeneous degree constraints that will always find a feasible solution or terminate should the problem be infeasible. Numerical results are presented to demonstrate the effectiveness of my method in comparison with genetic algorithm methods proposed by other researchers.