Results 201 to 210 of about 8,257 (239)
A visualization software for the network simplex algorithm
Proceedings of the 2006 ACM symposium on Software visualization - SoftVis '06, 2006 The teaching experiences of the network simplex algorithm to postgraduate students at our department, lead us to develop a visualization software which aims to support the instructor in his effort to explain the algorithm to the students. In addition we believe that the software will help students in their endeavor to understand the aforementioned ...
Thanasis Baloukas +1 more
openaire +2 more sources
A new pivot selection rule for the network simplex algorithm
Mathematical Programming, 1997 We present a new network simplex pivot selection rule, which we call the minimum ratio pivot rule, and analyze the worst-case complexity of the resulting network simplex algorithm. We consider networks with n nodes, m arcs, integral arc capacities and integral supplies/demands of nodes. We define a {0, 1}-valued penalty for each arc of the network. The
Sokkalingam, P. T. +2 more
openaire +3 more sources
An exterior simplex type algorithm for the Minimum Cost Network Flow Problem
Computers & Operations Research, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Konstantinos Paparrizos +2 more
openaire +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Network simplex algorithm for the general equal flow problem
European Journal of Operational Research, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Herminia I Calvete
exaly +2 more sources
Network Simplex Algorithm for DAG Layering
2013 International Conference on Computational and Information Sciences, 2013This article is committed to the problem of partitioning a directed acyclic graph into layers such that all edges to the same direction. At first we perform an experimental analysis of some of the existing layering algorithm. Then we propose network simplex algorithm based on linear programming to layer a graph. The goal is to minimize the total sum of
Hai Tang
exaly +2 more sources
An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem
Operations Research, 1999We present an O(nm)-time network simplex algorithm for finding a tree of shortest paths from a given node to all other nodes in a network of n nodes and m directed arcs or finding a directed cycle of negative length. The worst-case running time of this algorithm is as fast as that proved for any strongly polynomial algorithm and faster than that ...
Donald Goldfarb, Zhiying Jin
exaly +2 more sources
Solving Multicommodity Flow Problems with a Primal Embedded Network Simplex Algorithm
INFORMS Journal on Computing, 1997This article describes the authors’ experience solving large multicommodity flow problems with an embedded network simplex algorithm augmented with a fast-start heuristic for choosing an initial basis. The heuristic makes successive capacity allocations in an attempt to find a feasible initial basis.
Richard D Mcbride
exaly +3 more sources
On strongly polynomial variants of the network simplex algorithm for the maximum flow problem
Operations Research Letters, 1991The specialization of the primal simplex method known as the network simplex algorithm can be used to solve a network flow problem. Recently, the authors [Math. Program., Ser. A 47, No. 3, 353-365 (1990; Zbl 0713.90028)] proved that this algorithm with what they called the smallest label and smaller label pivot rules solves a maximum flow problem on an
Donald Goldfarb
exaly +2 more sources
A specialized network simplex algorithm for the constrained maximum flow problem
European Journal of Operational Research, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +3 more sources
A polynomial time primal network simplex algorithm for minimum cost flows
Mathematical Programming, 1997 Developing a polynomial time primal network simplex algorithm for the minimum cost flow problem has been a long standing open problem. In this paper, we develop one such algorithm that runs in O(min(n^2m log nC, n^2m^2 log n)) time, where n is the number
James B Orlin, Orlin James B
exaly +1 more source