README

SEC: Network Flow - Practicals

Welcome to the collection of practical assignments for the Network Flow course. This repository contains implementations for various network flow algorithms and problems solved using Microsoft Excel.

📅 List of Practicals

The following problems are implemented across various Excel workbooks:

1️⃣ Optimization Problems

Practical 1: Assignment Problem (AP).xlsx) - Solving assignment problems to minimize cost or time.
Practical 2: Transportation Problem (TP).xlsx) - Implementing transportation models for supply-demand optimization.
Practice Questions: AP & TP.xlsx) - Additional exercises covering Assignment and Transportation problems.

2️⃣ Network Flow Algorithms

Practical 3: Shortest Path Problem.xlsx) - Finding the minimum distance/cost path between nodes in a network.
Practical 4: Minimum Spanning Tree (MST).xlsx) - Implementing algorithms (like Kruskal's or Prim's logic) to find the MST.
Practical 5: Maximum Flow Problem (MFP).xlsx) - Calculating the maximum throughput in a flow network.
Practical 6: Minimum Cost Flow (MCF).xlsx) - Finding the cheapest way to send a specific amount of flow through a network.

3️⃣ Case Studies

Case Study 1.xlsx) - Real-world application and modeling of network flow concepts.
Case Study 2.xlsx) - Advanced modeling and analysis of networking scenarios.

📖 Introduction

Front page with index for submitting assignment is present in Intoduction.docx file.

<i>Developed with ❤️ by <a href="https://github.com/16ratneshkumar">16ratneshkumar</a></i>

</p>

← Previous