Lectures related to Travelling salesman problem

Stochastic Programs: Problem Formulation

Discusses the problem formulation of 2-stage stochastic programs and the Benders decomposition algorithm.

Ant Colony Optimization: Routing and Optimization

Explores Ant Colony Optimization (ACO) for routing and optimization, discussing constructive heuristics, local search, pheromone mechanisms, and real-world applications.

Branch & Bound Algorithm: LP Based Approach

Explores the LP-based Branch & Bound algorithm for finding optimal solutions.

Traveling Salesman Problem: Resolution Algorithms

Explores the Traveling Salesman Problem, resolution algorithms, minimum spanning tree, and shortcut optimization.

Minimum Spanning Trees: Prim's Algorithm

Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.

Financial Market Models: Arbitrage and Completeness

Explores arbitrage-free and complete financial market models, risk-neutral probabilities, structured notes pricing, and option hedging.

Discrete Optimization: Traveling Salesman Problem

Covers the traveling salesman problem, modeling, constraints, additional constraints, and network representation.

Optimization and Simulation

Explores greedy heuristics in optimization, integrality constraints, and comparison of optimization methods.

Quantum Approximate Optimization Algorithm

Covers the Quantum Approximate Optimization Algorithm, physically inspired unitary coupled cluster ansatz, hardware-efficient ansatz, and variational quantum eigensolver.

Thermodynamic Properties: Equations and Models

Explains thermodynamic properties, equations of state, and mixture rules for energy systems modeling.

Algorithm Design: Divide and Conquer

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

Optimisation in Energy Systems

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

Dining Philosophers Problem

Discusses algorithms to prevent starvation and maximize philosophers eating simultaneously.

Distributed Computation I

Explores distributed computation between two parties in a distant setting.

Optimization: Classical Problems

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

Algorithmes: introduction

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

Linear Programming: Convex Hull

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

Traveling Salesman Problem: Introduction and Approximation Methods

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

Cutset Formulation: MST Problem

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

Exact Methods for Integer Optimization

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