Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
Assignment problemGraph theoryMathematical optimizationMinimum-cost flow problem

Broader (3)

Linear programmingNetwork theoryOperations research

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Min-cost flow problems and network simplex algorithm
The particular structure of some LP problems can be sometimes used for the design of solution techniques more efficient than the… 
2013
2013
Power and resource aware scheduling with multiple voltages
In this paper, we address the problem of timing-constrained scheduling with resources operating at multiple voltages. Without the… 
2009
2009
A network simplex algorithm for solving the minimum distribution cost problem
To model the distillation or decomposition of products in some manufacturing processes, a minimum distribution cost problem (MDCP… 
2009
2009
On the Computational Behavior of a Dual Network Exterior Point Simplex Algorithm for the Minimum Cost Network Flow Problem
The Minimum Cost Network Flow Problem (MCNFP) constitutes a wide category of network flow problems. A Dual Network Exterior Point… 
2006
2006
Convex cost flow.Adaptation of network simplex algorithm
Starting from the optimality test in Network Simplex Algorithm with linear objective function and the way of keeping a convex… 
2005
2005
APPLYING THE EXTENDED NETWORK SIMPLEX ALGORITHM TO DYNAMIC AUTOMATED GUIDED VEHICLE SCHEDULING
Scheduling of vehicles in the container terminal is often studied as a static problem in the literature, where all information… 
2004
2004
Extreme Point Solutions for Infinite Network Flow Problems ∗
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having… 
2004
2004
Implementing an LU Factorization for the Embedded Network Simplex Algorithm
This paper presents an LU factorization specialized for embedded network simplex algorithms. Specializing the LU factorization in… 
1996
1996
A Faster Primal Network Simplex Algorithm
We present a faster implementation of the polynomial time primal simplex algorithm due to Orlin [23]. His algorithm requires O(nm… 
1991
1991
A computational comparison of the network simplex method with the dual affine scaling method