Discrete optimization: traveling salesman problem

preview_player
Показать описание
Bierlaire (2015) Optimization: principles and algorithms, EPFL Press. Section 25.2.3
  1. Michel Bierlaire
  2. Optimization
Рекомендации по теме
Discrete optimization: traveling 0:10:26

Discrete optimization: traveling salesman problem

The Traveling Salesman 0:30:27

The Traveling Salesman Problem: When Good Enough Beats Perfect

What is the 0:02:42

What is the Traveling Salesman Problem?

Traveling Salesman Problem 0:02:23

Traveling Salesman Problem Visualization

Traveling Salesman as 0:09:11

Traveling Salesman as an Integer Programming Problem

MET 503 Lecture 1:26:06

MET 503 Lecture 17: Discrete Optimization (2)

4.7 Traveling Salesperson 0:15:25

4.7 Traveling Salesperson Problem - Dynamic Programming

Effective Optimization Solver 0:08:04

Effective Optimization Solver for Travelling Salesman Problem (TSP)

The Subtour LP 0:51:01

The Subtour LP for the Traveling Salesman Problem

[OR1-Modeling] Lecture 3: 0:11:36

[OR1-Modeling] Lecture 3: Integer Programming #10 Traveling salesperson problem: Basics

L-5.4: Traveling Salesman 0:14:12

L-5.4: Traveling Salesman Problem | Dynamic Programming

Ant Colony Optimization 0:14:02

Ant Colony Optimization - Part 5: Example - Traveling Saleman Problem (TSP)

Travelling Salesman Problem 0:08:47

Travelling Salesman Problem (SC 205 Discrete Mathematics Project 2021-22)

Discrete Optimization 0:25:13

Discrete Optimization

Solving Travelling Salesman 0:06:38

Solving Travelling Salesman (TSP) Using 2 Opt Algorithm in Python

Dragonspeech 101 - 0:04:21

Dragonspeech 101 - Modeling Discrete Optimization

A Constant-factor Approximation 1:07:59

A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem

Traveling Salesman Problem: 0:05:43

Traveling Salesman Problem: A short introduction

Discrete optimization: modeling 0:16:17

Discrete optimization: modeling

Discrete Math 5.2 0:14:37

Discrete Math 5.2 Traveling Salesperson Problem

7.3 Traveling Salesman 0:24:42

7.3 Traveling Salesman Problem - Branch and Bound

[UoM Leaks] Discrete 0:20:50

[UoM Leaks] Discrete Optimization Lecture

Traveling Salesperson Problem 0:08:37

Traveling Salesperson Problem (TSP) - Formulation-2

Xavier Bresson: 'The 0:30:13

Xavier Bresson: 'The Transformer Network for the Traveling Salesman Problem'

Комментарии
Автор

Hi Michel. Great video. Just one question: in the case that xij = 0, yi - yj is going to be smaller than 0, as i is predecessor of j right? Therefore, I don't understand how the constraint proofs anything. Could you clarify?

jmdelfa
Автор

Hi Michel, thanks so much for the in depth explanation. But I've a doubt: why is yj - y1 >= 1 and not yj - y1 = 1?

sohambhowal
Автор

in which video the optional constraints were used?

yasminejanah
visit shbcf.ru