Skip to main content
Graph
Search
fr
|
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Optimal Power Flow: Constraints and Relaxations
Graph Chatbot
Related lectures (32)
Previous
Page 4 of 4
Next
Max-Cut Problem: SDP Relaxation and Randomized Rounding
Explores the Max-Cut Problem, its relaxation using SDP, and Polynomial Optimization.
Integer Programs: Optimization and Constraints
Explores integer programs, nonconvex optimization, constraints, and geometric aspects of linear programming for optimal solutions.
