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

Mapping Intimacies ◽

10.21236/ada215109 ◽

1988 ◽

Author(s):

Robert E. Tarjan

Keyword(s):

Minimum Cost ◽

Simplex Algorithm ◽

Minimum Cost Circulation ◽

Network Simplex Algorithm ◽

Network Simplex ◽

Circulation Problem

Download Full-text

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

Mathematics of Operations Research ◽

10.1287/moor.16.2.272 ◽

1991 ◽

Vol 16 (2) ◽

pp. 272-291 ◽

Cited By ~ 11

Author(s):

Robert E. Tarjan

Keyword(s):

Minimum Cost ◽

Simplex Algorithm ◽

Minimum Cost Circulation ◽

Network Simplex Algorithm ◽

Network Simplex ◽

Circulation Problem

Download Full-text

Parallel network simplex algorithm for the minimum cost flow problem

Concurrency and Computation Practice and Experience ◽

10.1002/cpe.6659 ◽

2021 ◽

Author(s):

Gökçehan Kara ◽

Can Özturan

Keyword(s):

Flow Problem ◽

Minimum Cost ◽

Simplex Algorithm ◽

Minimum Cost Flow ◽

Network Simplex Algorithm ◽

Minimum Cost Flow Problem ◽

Parallel Network ◽

Cost Flow ◽

Network Simplex

Download Full-text

A polynomial time primal network simplex algorithm for minimum cost flows

Mathematical Programming ◽

10.1007/bf02614365 ◽

1997 ◽

Vol 78 (2) ◽

pp. 109-129 ◽

Cited By ~ 80

Author(s):

James B. Orlin

Keyword(s):

Polynomial Time ◽

Minimum Cost ◽

Simplex Algorithm ◽

Network Simplex Algorithm ◽

Minimum Cost Flows ◽

Network Simplex

Download Full-text

Multi-granularity hybrid parallel network simplex algorithm for minimum-cost flow problems

The Journal of Supercomputing ◽

10.1007/s11227-020-03227-9 ◽

2020 ◽

Vol 76 (12) ◽

pp. 9800-9826

Author(s):

Jincheng Jiang ◽

Jinsong Chen ◽

Chisheng Wang

Keyword(s):

Minimum Cost ◽

Simplex Algorithm ◽

Minimum Cost Flow ◽

Flow Problems ◽

Network Simplex Algorithm ◽

Parallel Network ◽

Cost Flow ◽

Network Simplex ◽

Minimum Cost Flow Problems

Download Full-text

Modified bounded dual network simplex algorithm for solving minimum cost flow problem with fuzzy costs based on ranking functions

Journal of Intelligent & Fuzzy Systems ◽

10.3233/ifs-2012-0545 ◽

2013 ◽

Vol 24 (1) ◽

pp. 191-198 ◽

Cited By ~ 9

Author(s):

A. Ebrahimnejad ◽

S.H. Nasseri ◽

S.M. Mansourzadeh

Keyword(s):

Flow Problem ◽

Minimum Cost ◽

Simplex Algorithm ◽

Ranking Functions ◽

Minimum Cost Flow ◽

Network Simplex Algorithm ◽

Minimum Cost Flow Problem ◽

Cost Flow ◽

Network Simplex

Download Full-text

Efficiency of the Network Simplex Algorithm for the Maximum Flow Problem

10.21236/ada214691 ◽

1988 ◽

Author(s):

Andrew V. Goldberg ◽

Michael D. Grigoriadis ◽

Robert E. Tarjan

Keyword(s):

Flow Problem ◽

Maximum Flow ◽

Simplex Algorithm ◽

Maximum Flow Problem ◽

Network Simplex Algorithm ◽

Network Simplex

Download Full-text

Network Models and the Network Simplex Algorithm

Linear Optimization and Duality ◽

10.1201/9781315117218-11 ◽

2020 ◽

pp. 305-338

Author(s):

Craig A. Tovey

Keyword(s):

Network Models ◽

Simplex Algorithm ◽

Network Simplex Algorithm ◽

Network Simplex

Download Full-text

The Network Simplex Algorithm

Graphs, Networks and Algorithms - Algorithms and Computation in Mathematics ◽

10.1007/978-3-540-72780-4_11 ◽

2008 ◽

pp. 343-361

Keyword(s):

Simplex Algorithm ◽

Network Simplex Algorithm ◽

Network Simplex

Download Full-text

Network Simplex Algorithm for DAG Layering

2013 International Conference on Computational and Information Sciences ◽

10.1109/iccis.2013.401 ◽

2013 ◽

Cited By ~ 2

Author(s):

Hai Tang ◽

Zhihui Hu

Keyword(s):

Simplex Algorithm ◽

Network Simplex Algorithm ◽

Network Simplex

Download Full-text

An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem

Operations Research ◽

10.1287/opre.47.3.445 ◽

1999 ◽

Vol 47 (3) ◽

pp. 445-448 ◽

Cited By ~ 9

Author(s):

Donald Goldfarb ◽

Zhiying Jin

Keyword(s):

Shortest Path ◽

Simplex Algorithm ◽

Shortest Path Problem ◽

Network Simplex Algorithm ◽

Network Simplex

Download Full-text