Seminar: New Algorithm to solve the Traveling Salesperson Problems (TSP)
Assoc. Prof. Osman Oğuz, Industrial Engineering, Bilkent University
Feb 9, Friday 13:40
EA-409
Abstract
A linear programming model is solved by the Simplex Algorithm to get always the same kind of patterns as results. The patterns are composite subtours and they can be decomposed into a number of distinct and different length subtours. Iterations continue until a TSP tour is detected.
Short Bio
Ph.D., Management Sciences, University of Waterloo, 1978. Mathematical programming, linear and integer programming, project scheduling.