![]() |
![]() |
![]() |
![]() |
||
|
|||
|
|
|||
|
CSCI 8316 Basic concepts of integer programming, network programming and related topics. Content includes the mathematical foundations and solution algorithms of discrete optimization problems including transportation problems, network problems, and integer programming. Credit 3 semester hours Prerequisites MATH 2050, MATH/CSCI 4300/8306, or permission of instructor. Not open to nondegree students. Cross-listed as MATH-4310, MATH-4300, MATH-8306, MATH-8306 |
|||
| © 2007 UNO Computer Science, all rights reserved | |||