Discrete Optimization: Traveling Salesman Problem

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (32)

Page 2 of 4

Metropolis Algorithm: Optimization and Probabilistic Approach

Covers the Metropolis algorithm for approximate optimization using lazy chains and exploring state space efficiently.

Optimal Decision Making: Integer Programming

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

Linear Programming: Weighted Bipartite Matching

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

Exact methods: Branch and Bound

Explores the Branch and Bound algorithm in discrete optimization, efficiently finding optimal solutions by calculating lower bounds on subsets.

Discrete Optimization: Relaxation

Explores solving discrete optimization problems by relaxing integrality constraints.

Discrete Optimization: The Curse of Dimensionality

Delves into the curse of dimensionality in discrete optimization, highlighting the challenges of exponential computational time growth with problem size.

Optimization: Constrained Volume Problems

Explores constrained volume problems using Lagrange multipliers to find extrema under constraints in various examples.

Optimal Decision Making: Applications of Discrete Optimization

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

Optimization Problems: Path Finding and Portfolio Allocation

Covers optimization problems in path finding and portfolio allocation.

Optimization Problems: Lagrange Multiplier Equations

Introduces the Lagrange multiplier method for solving optimization problems with constraints.