Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Network simplex algorithm

Known as: Network simplex method 
In mathematical optimization, the network simplex algorithm is a graph theoretic specialization of the simplex algorithm. The algorithm is usually… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
The periodic event scheduling problem (PESP), in which events have to be scheduled repeatedly over a given period, is a complex… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
  • T. Ersson, X. Hu
  • Proceedings IEEE/RSJ International Conference on…
  • 2001
  • Corpus ID: 16756502
For a robot trying to reach places in at least partially unknown environments there is often a need to replan paths online based… Expand
  • figure 1
  • figure 2
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
1997
Highly Cited
1997
  • R. Tarjan
  • Math. Program.
  • 1997
  • Corpus ID: 18977577
Thedynamic tree is an abstract data type that allows the maintenance of a collection of trees subject to joining by adding edges… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Developing a polynomial time primal network simplex algorithm for the minimum cost flow problem has been a long standing open… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1996
1996
This paper presents a large-scale real-world application of the minimum-cost flow problem, describes some details of a new… Expand
Is this relevant?
Highly Cited
1993
Highly Cited
1993
We present a new solution approach for the multicommodity network flow problem (MCNF) based upon both primal partitioning and… Expand
Is this relevant?
1992
1992
In this paper, we present a new primal simplex pivot rule and analyze the worst case complexity of the resulting simplex… Expand
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Given a network having costs and upper bound constraints on the flows in its arcs, the minimum-cost network flow problem is that… Expand
Is this relevant?
Highly Cited
1979
Highly Cited
1979
An example of cycling in the network simplex method is given and some restrictions on its occurrence are proved. An example of… Expand
Is this relevant?
Highly Cited
1976
Highly Cited
1976
Simple combinatorial modifications are given which ensure finiteness in the primal simplex method for the transshipment problem… Expand
  • figure 1
Is this relevant?