\BOOKMARK [1][-]{section.1}{General Information}{}
\BOOKMARK [1][-]{section.2}{Syllabus Sketch and Weekly Schedule}{}
\BOOKMARK [2][-]{subsection.2.1}{Rudiments}{section.2}
\BOOKMARK [3][-]{subsubsection.2.1.1}{Polytopes and Linear Programming}{subsection.2.1}
\BOOKMARK [2][-]{subsection.2.2}{Elementary Analysis}{section.2}
\BOOKMARK [3][-]{subsubsection.2.2.1}{Matroids and the Greedy Algorithm}{subsection.2.2}
\BOOKMARK [3][-]{subsubsection.2.2.2}{Minimum-weight Dipaths}{subsection.2.2}
\BOOKMARK [3][-]{subsubsection.2.2.3}{Matroid Intersection}{subsection.2.2}
\BOOKMARK [2][-]{subsection.2.3}{Advanced Analysis}{section.2}
\BOOKMARK [3][-]{subsubsection.2.3.1}{Matching}{subsection.2.3}
\BOOKMARK [3][-]{subsubsection.2.3.2}{Flows and Cuts}{subsection.2.3}
\BOOKMARK [2][-]{subsection.2.4}{Advanced Tools}{section.2}
\BOOKMARK [3][-]{subsubsection.2.4.1}{Cutting Planes}{subsection.2.4}
\BOOKMARK [3][-]{subsubsection.2.4.2}{Branch \046 Bound}{subsection.2.4}
\BOOKMARK [3][-]{subsubsection.2.4.3}{Optimizing Submodular Functions}{subsection.2.4}
\BOOKMARK [1][-]{section.3}{Academic Integrity Statement}{}
\BOOKMARK [1][-]{section.4}{Social Justice Statement}{}