Network flows are part of information technology systems to keep it running smoothly. Resolving network flow issues and problems is part of linear programming problems in the sectors of transportation, logistics, manufacturing, etc.

You will be introduced to theories and concepts in network flows through this **[course_title].** This course is designed to help you address network flow problems such as shortest path problem, maximum flow problem, minimum cost flow, and many more.

**Assessment**

This course does not involve any written exams. Students need to answer 5 assignment questions to complete the course, the answers will be in the form of written work in pdf or word. Students can write the answers in their own time. Each answer needs to be 200 words (1 Page). Once the answers are submitted, the tutor will check and assess the work.

**Certification**

Edukite courses are free to study. To successfully complete a course you must submit all the assignment of the course as part of the assessment. Upon successful completion of a course, you can choose to make your achievement formal by obtaining your Certificate at a cost of £49.

Having an Official Edukite Certification is a great way to celebrate and share your success. You can:

- Add the certificate to your CV or resume and brighten up your career
- Show it to prove your success

Course Credit: MIT

### Course Curriculum

Module 01 | |||

Introduction to network models | 01:00:00 | ||

Computational complexity and data structures | 01:00:00 | ||

Graph search algorithms | 00:45:00 | ||

Transformations and flow decomposition | 00:45:00 | ||

Shortest paths: label setting algorithms | 00:45:00 | ||

The radix heap algorithm | 00:30:00 | ||

Shortest paths: label correcting algorithms | 00:45:00 | ||

Algorithm analysis | 00:45:00 | ||

Basic algorithms for the maximum flow problem | 00:45:00 | ||

Combinatorial applications of maximum flows | 00:45:00 | ||

Module 02 | |||

Preflow push algorithms | 00:45:00 | ||

More on preflow push algorithms | 00:45:00 | ||

Minimum cost flow: basic algorithms | 01:00:00 | ||

Minimum cost flow: polynomial time algorithms | 00:45:00 | ||

Applications of network flows; Linear programming review | 00:45:00 | ||

The network simplex algorithm | 01:00:00 | ||

Lagrangian relaxation 1 | 01:00:00 | ||

Lagrangian relaxation 2 | 01:15:00 | ||

Multicommodity flows 1 | 00:45:00 | ||

Multicommodity flows 2 | 00:45:00 | ||

Assessment | |||

Submit Your Assignment | 00:00:00 | ||

Certification | 00:00:00 |

### Course Reviews

No Reviews found for this course.

**429 STUDENTS ENROLLED**