sir what about this approach: intially lb=infinty: if len is the length of the first path we found....and as len < lb :we update lb=len and we traverse through remaining paths: i) if for a particular path at particular vertex if the path length is greater than lb ,then we cut that path: ii)else when a path is found whose len < lb :then we update lb=len: finally we return lb as a least possible path:
liked your thinking :-).. the purpose of lower bound is to restrict ourselves in construction of state space tree. Your idea will not work here because Initial value you want consider is largest..
one of the most detailed and simple explaination of TSP uding B&B. thanks a lot sir ♥♥♥
best mic quality ever heard
The least two edges of SIDE 'C' is (1+2) in the beginning node 0
sir what about this approach:
intially lb=infinty:
if len is the length of the first path we found....and as len < lb :we update lb=len
and we traverse through remaining paths:
i) if for a particular path at particular vertex if the path length is greater than lb ,then we cut that path:
ii)else when a path is found whose len < lb :then we update lb=len:
finally we return lb as a least possible path:
liked your thinking :-).. the purpose of lower bound is to restrict ourselves in construction of state space tree. Your idea will not work here because Initial value you want consider is largest..
there is no rigid rule that, lb should considered like this only.. only requirement is it should be more informative.
Very helpful Sir
thank you so much sir,This was very helpful.
Kindly improve muc quality, otherwise nice explanation
Thank you.
Just like b before c..y not c before d in 3 rd level ...and cancel d,e
As the graph is undirected, without the loss of generality, one can assume the paths where b is visited before c. But it's not a mandatory condition.
Nice explanation
16+7 = 23 not 24
Sir ur voice is not properly sir.. please check it...bz unable to listen properly ur words
I like how confident he's in front of the camera
sir, u are confused while u teaching, si explain properly
Thank you.. not comfortable in front of camera.. just created videos due to lockdown
@@designandanalysisofalgorit5587 good try sir
it 28 not 29 at 4:26
Yes I agree .. thank you
Well explained
worst ever
Fo