Network simplex algorithm - Open Access .click

Results 221 to 230 of about 8,257 (239)

Some of the next articles are maybe not open access.

Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem

Mathematics of Operations Research, 1991
We study the number of pivots required by the primal network simplex algorithm to solve the minimum-cost circulation problem. We propose a pivot selection rule with a bound of n(logn)/2+O(1) on the number of pivots, for an n-vertex network. This is the first known subexponential bound. The network simplex algorithm with this rule can be implemented to
openaire +2 more sources

Network Simplex: The Fastest Algorithm

2022
Hassan Rashidi, Edward P. K. Tsang
openaire +1 more source

Parallel network simplex algorithm for the minimum cost flow problem

Concurrency Computation Practice and Experience, 2022
Gokcehan Kara, Can Ozturan
exaly

Network simplex algorithm

2001
Saul I. Gass, Carl M. Harris
openaire +1 more source

A Simplex-based simulated annealing algorithm for node-arc capacitated multicommodity network design

Applied Soft Computing Journal, 2012
Masoud Yaghini, Mohsen Momeni
exaly

Network simplex algorithm

2011
openaire +1 more source

Network Models and the Network Simplex Algorithm

2020
openaire +1 more source