Mathematics honor's thesis

MATH 514 Networks and Combinatorial Optimization (3)
Mathematical foundations of combinatorial and network optimization with an emphasis on structure and algorithms with proofs. Topics include combinatorial and geometric methods for optimization of network flows, matching, traveling salesmen problem, cuts, and stable sets on graphs. Special emphasis on connections to linear and integer programming, duality theory, total unimodularity, and matroids. Prerequisite: either MATH 308 or AMATH 352 any additional 400-level mathematics course. Offered: jointly with AMATH 514.
View course details in MyPlan: MATH 514

Mathematics honor's thesis

mathematics honor's thesis

Media:

mathematics honor's thesismathematics honor's thesismathematics honor's thesismathematics honor's thesis