Results 161 to 170 of about 7,621 (201)
Some of the next articles are maybe not open access.
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
A simplex algorithm for minimum‐cost network‐flow problems in infinite networks
Networks, 2008AbstractWe study minimum‐cost network‐flow problems in networks with a countably infinite number of nodes and arcs and integral flow data. This problem class contains many nonstationary planning problems over time where no natural finite planning horizon exists. We use an intuitive natural dual problem and show that weak and strong duality hold.
Thomas Sharkey
exaly +3 more sources
A primal–dual simplex algorithm for bi-objective network flow problems
4or, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
JOSÉ Figueira +2 more
exaly +4 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 ...
Zhiying Jin, Donald Goldfarb
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
The simplex algorithm for multicommodity networks
Networks, 2001AbstractWe consider multicommodity network flow problems, where external flow is allowed to vary and where flows of individual commodities may be constrained. For this problem, we describe the simplex algorithm. The simplex algorithm is based upon the inverse of the basis matrix. We discuss an approach where we only have to invert a working matrix with
Detlefsen, Nina, Wallace, Stein W
openaire +3 more sources
A continuous‐time network simplex algorithm
Networks, 1989AbstractGiven a network having costs and upper bound constraints on the flows in its arcs, the minimum‐cost network flow problem is that of finding flows which satisfy a flow‐conservation constraint at each node and minimize the total cost of the flow. If the arc capacities vary as functions of time, and storage is permitted at the nodes of the network,
Edward J. Anderson, Andrew B. Philpott
openaire +2 more sources
A visualization software for the network simplex algorithm
Proceedings of the 2006 ACM symposium on Software visualization - SoftVis '06, 2006The 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 +1 more source