UeduGPTs

--

Jupyters

1

Local AI

--

Uedu Code

--

CISOSE26 Local AI Uedu Code UG26

AI Reply Desktop Notifications

Show a desktop notification when the AI TA finishes replying

Chat Message Notifications

Notify me when classmates post messages in the forum

Sound notification

Play an alert sound whenever there is a new notification

More settings

Account settings Data privacy settings Research Informed Consent Form

18.433

Combinatorial Optimization

Prof. Santosh Vempala | Fall 2003

Business & Management Systems Thinking Data Science, Analytics & Computer Technology Algorithms and Data Structures Computer Science Science & Math Mathematics Engineering

Go to original course

CC BY-NC-SA 4.0

Course introduction

Combinatorial Optimization provides a thorough treatment of linear programming and combinatorial optimization. Topics include network flow, matching theory, matroid optimization, and approximation algorithms for NP-hard problems.

Course Information

Source	MIT 開放式課程
Department	Mathematics
Language	English
Number of videos	0

Course videos (0)

No video materials are available for this Course yet
Go to the original course page to view

--

1

--

--

32.3%

140.05

82.02%

62,201