While the minimum cost flow (MCF) problems have been well documented in many publications, due to its broad applications, little or no effort devoted explaining algorithms for identifying loop formation and computing θ value needed solve MCF network problems. This paper proposes efficient algorithms, MATLAB computer implementation, solving Several academic real-life solved validate proposed alg...

The minimum-cost flow (MCF) problem is a fundamental optimization problem with many applications and seems to be well understood. Over the last half century many algorithms have been developed to solve the MCF problem and these algorithms have varying worst-case bounds on their running time. However, these worst-case bounds are not always a good indication of the algorithms’ performance in prac...

The Minimum Cost Network Flow Problem (MCNFP) constitutes perhaps the most important of the research area of Network Optimization. Recently a new category of algorithms for the MCNFP have been developed. These algorithms belong to a special “exterior type” simplex category and they feature significant tree modifications. This paper presents a new didactic tool for the teaching of this type of a...

the ability to discover services in mobile ad hoc network (manet) is a major prerequisite. cluster basedcross layer intelligent service discovery for manet (cbisd) is cluster based architecture, caching ofsemantic details of services and intelligent forwarding using network layer mechanisms. the cluster basedarchitecture using semantic knowledge provides scalability and accuracy. also, the mini...

The problem of finding a minimal cost-reliability ratio path is considered. The optimal solution to this problem is shown to map into an extreme supported non-dominated objective point in the objective space of the biobjective shortest path problem. Different forms of reliability are presented. We assume that this reliability does not change over time. We employ a parametric network simplex alg...

logistic network design is one of the most important strategic decisions in supply chain management that has recently attracted the attention of many researchers. transportation network design is then one of the most important fields of logistic network. this study is concerned with designing a multi-stage and multi-product logistic network. at first, a mixed integer nonlinear programming model...

In “An artificial-free simplex-type algorithm for general LP models” [Math. Comput. Model., 25 (1997), pp. 107–123] and “Initialization of the simplex algorithm: An artificial-free approach” [SIAM Rev., 39 (1997), pp. 736–744], Arsham presents a new Phase 1 algorithm for the simplex method of linear programming, which allegedly obviates the use of artificial variables. He claims in [SIAM Rev., ...

We introduce an algorithm that solves the maximum ow problem without generating ows explicitly. The algorithm solves directly a problem we call the maximum s-excess problem. That problem is equivalent to the minimum cut problem, and is a direct extension of the maximum closure problem. The concepts used also lead to a new parametric analysis algorithm generating all breakpoints in the amount of...

this paper presents a hybrid approach to developing a short-term traffic flow prediction model. in thisapproach a primary model is synthesized based on neural networks and then the model structure is optimized throughgenetic algorithm. the proposed approach is applied to a rural highway, ghazvin-rasht road in iran. the obtainedresults are acceptable and indicate that the proposed approach can i...

Abstract. We present a Branch-and-Cut algorithm where the volume algorithm is applied instead of the traditionally used dual simplex algorithm to the linear programming relaxations in the root node of the search tree. This means that we use fast approximate solutions to these linear programs instead of exact but slower solutions. We present computational results with the Steiner tree and Max-Cu...