Linear programming: simplex and revised simplex method, duality theory, primal-dual algorithms, Karmarkar's algorithm. Network flow problems: max-flow/min-cut theorem, Ford-Fulkerson algorithm, shortest path algorithms. Complexity and NP-completeness theory: the classes of P and NP,reductions between np-complete problems, pseudopolynomial and approximationalgorithms.

Prerequisites: ECE 210A (may be taken concurrently).

4

Units

Letter

Grading

1, 2, 3

Passtime

None

Level Limit

Engineering

College
MOSTOFI Y C
No info found
See All
Spring 2024 . Mostofi Y C
PHELP2514
M W
12:00 PM - 13:50 PM
Spring 2026 . Mostofi Y C
ILP 3314
M W
10:00 AM - 11:50 AM
See All
ECE 271A Mostofi Y C Winter 2025 Total: 19
ECE 271A Mostofi Y C Spring 2024 Total: 11
ECE 272A
0 / 45 Enrolled
Machine Learning in Design and Test Automation
Li-C Wang 4.3
M W
17:00 PM - 18:15 PM
ECE 273
0 / 60 Enrolled
TENSOR COMPUTATION FOR MACHINE LEARNING AND BIG DATA
Zheng Zhang 3.5
T R
12:30 PM - 13:45 PM
ECE 278C
0 / 30 Enrolled
Imaging Systems
Hua Lee 2.8
M W
16:00 PM - 17:50 PM
ECE 282
0 / 60 Enrolled
Error Correcting Codes
Yu Q
T R
16:00 PM - 17:50 PM
ECE 285
0 / 60 Enrolled
ADVANCED IMAGE SYNTHESIS
Pradeep Sen 3.2
T R
09:00 AM - 10:50 AM
ECE 295
0 / 70 Enrolled
Group Studies: Controls, Dynamical Systems, and Computation
Andrew Teel 4.4
F
14:30 PM - 17:50 PM