Friday, 20 Sep, 2019

011-28082485

011-47044510

+91-9899775880

Restricted Constraints in the Problem of Maximum Attainable Flow in Minimum Cost in a Network

Journal of Network and Information Security

Volume 3 Issue 2

Published: 2015
Author(s) Name: Nazimuddin Ahmed, Shobha Duttadeka | Author(s) Affiliation: Assistant Professor, Dept. of Statistics, D.H.S.K. College, Dibrugarh, Assam, India
Locked Subscribed Available for All

Abstract

In this paper we have considered a version of restricted constraints in the problem of maximum attainable flow (capacity) in minimum cost (distance) in a network (Ahmed, Das, & Purusotham, 2012b). By restricted constraints one means that the link(s) (cities or stations or nodes) are completed (or visited) in such a way that a particular link is to be preceded (completed or visited) by another link (precedence relation need not be immediate). Here the aim is to obtained an optimal route of a more realistic situation as to scheduling a restricted constraints to a maximum flows at a minimum cost from a source to a destination. The distance (cost) and arc capacity between any two stations are given.

Keywords: Distance and Capacity Matrix, Lexicographic Search Approach, Restricted Constraints and Algorithm

View PDF

Refund policy | Privacy policy | Copyright Information | Contact Us | Feedback © Publishingindia.com, All rights reserved