Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Quizes
Exercises
Publications
Startups
Units
Show all results for
Home
Lecture
Branch and Bound: Optimization Techniques
Graph Chatbot
Related lectures (49)
Approximation Algorithms
Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.
Optimization Methods: Theory Discussion
Explores optimization methods, including unconstrained problems, linear programming, and heuristic approaches.
Linear Programming: Weighted Bipartite Matching
Covers linear programming, weighted bipartite matching, and vertex cover problems in optimization.
Discrete Optimization: Relaxation
MOOC: Optimization: principles and algorithms - Network and discrete optimization
Explores solving discrete optimization problems by relaxing integrality constraints.
Energy System Modeling: Optimization and Performance Indicators
Explores energy system modeling using optimization techniques and performance indicators.
Hedging for LPs
Covers the concept of hedging for Linear Programs and the simplex method, focusing on minimizing costs and finding optimal solutions.
Simplex Algorithm: Solution on a Vertex
MOOC: Optimization: principles and algorithms - Linear optimization
Explores the simplex algorithm and how optimal solutions can be found on vertices of constraint polyhedra.
Optimisation Problem: Solving by FM
Covers the modelling and optimization of energy systems, focusing on solving optimization problems with constraints and variables.
Energy Conversion Systems Optimization
Explores energy conversion systems optimization through heat recovery and mixed integer linear programming.
Branch & Bound: Optimization
Log in to Mediaspace to watch this video
Covers the Branch & Bound algorithm for efficient exploration of feasible solutions and discusses LP relaxation, portfolio optimization, Nonlinear Programming, and various optimization problems.
Cutset Formulation: MST Problem
Log in to Mediaspace to watch this video
Explores the cutset formulation for the MST Problem and Gomory Cutting Planes method.
Branch and Bound: Heuristic Maximization
Log in to Mediaspace to watch this video
Explains the Branch and Bound algorithm for heuristic maximization problems using LP relaxations and pruning techniques.
Linear Programming Basics
Log in to Mediaspace to watch this video
Covers deriving basic linear program representation, finding solutions, and exploring optimality.
Optimal Decision Making: Integer Programming
Log in to Mediaspace to watch this video
Covers integer programming, convex hulls, Gomory cutting planes, and branch and bound methods.
Branch & Bound Algorithm: LP Based Approach
Log in to Mediaspace to watch this video
Explores the LP-based Branch & Bound algorithm for finding optimal solutions.
Simplex Algorithm: Basics
Log in to Mediaspace to watch this video
Introduces the Simplex algorithm for solving flow problems and handling negative cost cycles.
Optimal Decision Making: Sensitivity Analysis
Log in to Mediaspace to watch this video
Covers sensitivity analysis in linear programming, focusing on optimal solutions and their sensitivities to changes.
Semi-Definite Programming
Log in to Mediaspace to watch this video
Covers semi-definite programming and optimization over positive semidefinite cones.
Solving Integer Linear Programs
Log in to Mediaspace to watch this video
Covers solving integer linear programs graphically, algorithmically, and through optimization methods.
Optimization Problems: Path Finding and Portfolio Allocation
Log in to Mediaspace to watch this video
Covers optimization problems in path finding and portfolio allocation.
Previous
Page 1 of 3
Next
