MATH 483 - Linear and Combinatorial Optimization

(3.00)

Integer programming. The traveling salesman problem. Advanced linear programming techniques. Complexity. Projective methods in linear programming.The Karmarkar method.

Course ID: 55271
Consent: No Special Consent Required
Components: Lecture
Requirement Group: You must have completed MATH 381 with a grade of “C” or better before you can take this course.