AQA Decision 1 8.05 The Travelling Salesperson Problem: The Lower Bound Algorithm

[George_]

This video helped me fully understand this the night before my exam, luv ya Mr Brown

[shahariyarmujahid]

Fam I love this Yano big up my boy jack b soon touch road

[alpertroncp]

This is the way to do some last minute revision. These videos are a godsend, thank you for making them.

[billylardner]

Thank you for all of your videos! I find them very useful to consolidate what I've learnt in class. I was wondering if I could quickly ask you something; when you write the region that contains the optimal, should you always write <= for both the lower and upper bound? I remember my teacher talking about writing <= if you make a choice (when adding the 2 shortest arcs on at the end) but < if you don't for the lower bound. Is that right? Thanks again.

[KhanIOM]

Can you find the lower bound using matrix and still get full method marks (in D1 AQA)? In one mark scheme, it seemed to require a drawn MST with deleted A to get method marks for the question "By deleting A, find a lower bound for the minimum travelling time of Sarah’s tour" 

[edwarda.]

So are we trying to find a Hamiltonian cycle using the lower bound algorithm that is less than the upper bound? What is the significance of the 27 at the end being the lower bound?

[edwarda.]

When would you be allowed to repeat an edge like 3 coming out of the deleted vertex A

[reecemellor]

i know its a bit late but why wouldnt it be 27<x<or equal to 29

[husseinjusab]

Is the inequality always the same? When giving lowest and upper bound

[keenanpatel]

or using the network can u not got ec like if it was complete

[keenanpatel]

do we assume that the network is complete?