These problems will involve the material you have learned in this class: linear programming, integer programming, approximation algorithms and traveling salesperson problem. It will involve ...

Cross-listed with DTSA 5503. Course Type: Pathway | Breadth Specialization: Foundations of Data Structures and Algorithms Instructor: Dr. Sriram Sankaranarayanan, Professor of Computer Science Prior ...

This course covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP ...

Students interested in further readings can look at the books below: D Bertsimas and J N Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, 1997. S Boyd and L Vandenberghe, Convex ...