The student will use the techniques learned in this course and in previous courses to solve a number of logically complex programming problems using pseudocode, with an emphasis on establishing ...

These algorithms are significant because they can solve the noncommutative weighted Edmonds' problem in polynomial time, demonstrating that certain complex problems can be tackled efficiently [2].

Climate models can be a million lines of code long and can take months to run on supercomputers. A new algorithm has dramatically shortened that time.

This paper deals with the design of dynamic time-space and calibrated static strategic planning models, along with solution algorithms, for the multilevel rail-car fleet management problem faced by ...