YoVDO

Optimisation - Linear Integer Programming - Professor Raphael Hauser

Offered By: Alan Turing Institute via YouTube

Tags

Traveling Salesman Problem Courses Mixed-Integer Programming Courses Supply Chain Management Courses

Course Description

Overview

Explore linear integer programming and mixed integer programming in this comprehensive lecture by Professor Raphael Hauser from the Alan Turing Institute. Delve into supply chain management applications and learn about the branch and bound algorithm, including its use in solving the Traveling Salesman problem. Understand the mechanism of bounds, infeasibility, pruning by optimality, and LP relaxation. Examine fractional branching techniques and their implementation in optimization problems. Gain insights from a renowned expert with extensive experience in mathematics, theoretical physics, and operations research, whose work spans across numerical analysis, applied probability, and distributed computing.

Syllabus

Intro
Linear Integer Programming
Mixed Integer Programming
Supply Chain Management
Branch and Bound
Traveling Salesman
Branchandbound
Mechanism of Bounds
Example
Infeasibility
Pruning by Optimality
LP Relaxation
fractional branching


Taught by

Alan Turing Institute

Related Courses

Delivery Problem
University of California, San Diego via Coursera
Dynamic Programming
YouTube
What Is the Best Way to Lace Your Shoes? Dream Proof
Mathologer via YouTube
The Traveling Salesman Problem - When Good Enough Beats Perfect
Reducible via YouTube
Asymmetric Traveling Salesman Problem: Advances and Challenges - Session 1A
Association for Computing Machinery (ACM) via YouTube