Lecture
Branch and Bound: Heuristic Maximization
Related lectures (42)
Linear Programming: Extreme Points
Explores extreme points in linear programming and the role of constraints in finding optimal solutions.
Linear Programming: Optimization and Constraints
Explores linear programming optimization with constraints, Dijkstra's algorithm, and LP formulations for finding feasible solutions.
Linear Programming Basics
Covers the basics of linear programming and the simplex method, focusing on finding optimal solutions and handling degeneracy.
Integer Programming Basics
Introduces the basics of integer programming, including binary integer programs and constraint strategies.
Convex Polyhedra and Linear Programs
Explores convex polyhedra, linear programs, and their optimization importance.
Integer Program Formulation
Covers the process of formulating integer programs and improving solutions.
Simplex Algorithm: Basics
Introduces the Simplex algorithm for solving flow problems and handling negative cost cycles.
Shortest Path in Directed Graphs
Covers finding the shortest path in directed graphs efficiently using algorithmic approaches and discussing related NP-complete problems.
Dijkstra's Algorithm: All-Pairs
Covers Dijkstra's algorithm and its application to the all-pairs shortest path problem.
Solving Linear Programs: SIMPLEX Method
Explains the SIMPLEX method for solving linear programs and optimizing the solution through basis variable manipulation.