III year UG. Information Science Student. Love teaching. 

Sanjetha K S

The various problems solved using the branch and bound method

GATE (Graduate Aptitude Test in Engineering) 2020 & 2021 complete preparation with best educators. Know about the detailed syllabus, best books, exam pattern and dates, previous year question papers a

GATE - Iconic Pro

English

Branch and Bound

Algorithms

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

Flow of the how the course would be is explained

Introduction

Explains branch and bound technique and Integer programming method in brief

Branch and Bound Technique

Job Assignment Problem

One must keep in mind about the important rule which states: "You can visit each city once and you cannot pass through any traversed path"

Travelling Salesman Problem Using B and B

Knapsack Problem Using B and B

Code HELLOSONU01 | 8+ Years Teaching Exp. in GATE CS IT & GATE DS AI on Unacademy | Mentored 2 Lakh+ Students | Produced Rankers Under 500

Sweta Kumari

This course will cover Artificial Neural Networks in just 60 Minutes with full package.

(Hindi) Artificial Neural Networks in 60 Minutes

This course has discussed Sorting Algorithms with Complexities, working and some FAQs. The course will be beneficial for Engineering students and GATE aspirants.

(Hindi) Short Tricks to Remember Complexities of Sorting Algorithms

This course will cover dynamic Programming solution for Matrix Chain Multiplication and Longest Common Subsequence.

(Hindi) Dynamic Programming : MCM & LCS

This course will cover Asymptotic Analysis Of Algorithms with short notes targeted for GATE Aspirants.

(Hindi) Asymptotic Analysis Of Algorithms in 40 Minutes - GATE 2019

This course will cover Searching Algorithms Like Linear , Binary & Interpolation Search for  GATE CS/IT.

(Hindi) Searching Algorithms : Linear , Binary & Interpolation Search - GATE CS/IT

This course will cover 100 Short Tricks To Learn Complexities of Algorithms Easily. This Course is beneficial for  GATE (CS and IT) aspirants.

Lessons

5 lessons • 47m

Invalid Date

NaN

Introduction

Invalid Date

NaN

Branch and Bound Technique

Invalid Date

NaN

Job Assignment Problem

Invalid Date

NaN

Travelling Salesman Problem Using B and B

Invalid Date

NaN

Knapsack Problem Using B and B