Discrete Optimization: Traveling Salesman Problem

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (32)

Page 1 of 4

Discrete Optimization: Set Covering

Explores the set covering problem through the example of completing a sticker collection at a minimum cost.

Optimization with Constraints: KKT Conditions

Covers the KKT conditions for optimization with constraints, essential for solving constrained optimization problems efficiently.

Traveling Salesman Problem: Introduction and Approximation Methods

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

Optimization Methods: Theory Discussion

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

The Backpack Problem

Introduces the backpack problem, a discrete optimization problem with constraints and algorithms to solve it.

Optimisation in Energy Systems

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

Knapsack Problem: Optimization and Traveling Salesman

Explores the knapsack problem and the traveling salesman problem with a focus on optimization algorithms.

Optimization with Constraints: KKT Conditions

Covers the optimization with constraints, focusing on the Karush-Kuhn-Tucker (KKT) conditions.

Introduction to Optimization

Covers the basics of optimization, including historical perspectives, mathematical formulations, and practical applications in decision-making problems.

Linear Optimization Techniques: Problem Solving Approaches

Provides an overview of linear optimization techniques, focusing on problem-solving methods and the importance of constraints and objective functions.