Travelling salesman problem

Related lectures (30)

Page 2 of 3

Covers recursion, dynamic programming, and algorithm design using divide and conquer strategies.

Explores optimization in energy system modeling, covering decision variables, objective functions, and different strategies with their pros and cons.

Discusses algorithms to prevent starvation and maximize philosophers eating simultaneously.

Explores distributed computation between two parties in a distant setting.

Covers classical optimization problems, brute force algorithms, and integer linear optimization.

Covers the basics of algorithms, problem-solving, and efficient resolution methods.

Covers MAE regression, convex hull, reformulation advantages, and practical problems with decision variables and constraints.

Introduces the Traveling Salesman Problem and explores approximation methods using Markov chains.

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

Covers exact methods for integer optimization, emphasizing Branch and Bound techniques.