IE554Graduate
Discrete Optimization
Printed in the catalogue as DISCRETE OPTIMIZATION
Course content
The linear minimal cost flow problem and its solution by the network simplex algorithm. Maximal flow, shortest route and circulation problems. The integer programming problem and its solution by branch and bound and decomposition methods. Lagrangian relaxation.(R)
More in IE
- IE102Industrial Engineering Orientation
- IE206Scientific Computing for Industrial Engineering
- IE241Financial and Managerial Accounting for Engineers
- IE251Linear Programming
- IE252Network Flows and Integer Programming
- IE265Introduction to Probability
- IE266Engineering Statistics
- IE300Summer Practice I