We describe a four-pass algorithm for drawing directed graphs. The first pass finds an optimal rank assignment using a network simplex algorithm. The second pass sets the vertex order within ranks by an iterative heuristic incorporating a novel weight function and local transpositions to reduce crossings. The third pass finds optimal coordinates for nodes by constructing and ranking an auxiliar...

An algorithm for solving linear programming problems whose matrix of coefficients contains a large number of "zero" entries is studied. This algorithm is more useful when it is generated as a sub-program in a real-time program. The singly linked lists for storing only the non-zero entries of the coefficients matrix is used. The modified Revised Simplex Method is also used for solving such probl...

according to this fact that wind is now a part of global energy portfolio and due to unreliable and discontinuous production of wind energy; prediction of wind power value is proposed as a main necessity. in recent years, various methods have been proposed for wind power prediction. in this paper the prediction structure involves feature selection and use of artificial neural network (ann). in ...

By integrating the underlying developmental mechanisms for the phenotypic formation of traits into a mapping framework, functional mapping has emerged as an important statistical approach for mapping complex traits. In this note, we explore the feasibility of using the simplex algorithm as an alternative to solve the mixture-based likelihood for functional mapping of complex traits. The results...

We benchmark the dynamical simplex evolution (DSE) method with several of the currently available algorithms to detect communities in complex networks by comparing correctly identified nodes for different levels of "fuzziness" of random networks composed of well-defined communities. The potential benefits of the DSE method to detect hierarchical substructures in complex networks are discussed.

We consider the minimum cost network flow problem min(cx : Ax=b , x > 0) on a graph G = (V,E). First we give a minor modification of Edmonds-Karp scaling technique, and we show that it solves the minimum cost flow problem in 0((|V|'^ log 1v|)(|e| + |V| log |v|)) steps. We also provide two dual simplex algorithms that solve the minimum cost flow problem in 0(|v| log |v|) pivots and 0(|v| log |v|...

This paper deals with linear and integer programming problems in which the constraint matrix is a binet matrix. Binet matrices are pivoted versions of the node-edge incidence matrices of bidirected graphs. It is shown that efficient methods are available to solve such optimization problems. Linear programs can be solved with the generalized network simplex method, while integer programs are con...

Transportation problem is a linear programming which considers minimum cost for shipping a product from some origins to other destinations such as from factories to warehouse, or from a warehouse to supermarkets. To solve this problem simplex algorithmis utilized. In real projects costs and the value of supply and demands are fuzzy numbers and it is expected that optimal solutions for determini...

For a robot trying to reach places in at least partially unknown environments there is often a need to replan paths online based on information extracted from the surroundings. In this paper is is assumed that the sensing range of the robot is short compared to the length of the paths it plans and the environment is modeled as a graph consisting of nodes and arcs. The replanning problem is solv...