Exact methods: Branch and Bound

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (32)

Page 1 of 4

Cutset Formulation: MST Problem

Explores the cutset formulation for the MST Problem and Gomory Cutting Planes method.

Optimal Decision Making: Integer Programming

Covers integer programming, convex hulls, Gomory cutting planes, and branch and bound methods.

Discrete Optimization: Relaxation

Explores solving discrete optimization problems by relaxing integrality constraints.

Linear Programming: Weighted Bipartite Matching

Covers linear programming, weighted bipartite matching, and vertex cover problems in optimization.

Optimal Decision Making: Applications of Discrete Optimization

Explores optimal decision making through discrete optimization, emphasizing binary variables and practical applications.

Approximation Algorithms

Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.

Hedging for LPs

Covers the concept of hedging for Linear Programs and the simplex method, focusing on minimizing costs and finding optimal solutions.

Optimal Decision Making: Sensitivity Analysis

Covers sensitivity analysis in linear programming, focusing on optimal solutions and their sensitivities to changes.

Branch & Bound: Optimization

Covers the Branch & Bound algorithm for efficient exploration of feasible solutions and discusses LP relaxation, portfolio optimization, Nonlinear Programming, and various optimization problems.

Optimization Methods: Theory Discussion

Explores optimization methods, including unconstrained problems, linear programming, and heuristic approaches.