Primary simplex method for flow network

Janusz Jabłonowski, and Krystian Zorychta. "Primary simplex method for flow network." Mathematica Applicanda 18.32 (1990): null. <http://eudml.org/doc/292998>.

@article{JanuszJabłonowski1990,
abstract = {This paper describes an efficient network simplex algorithm for solving minimum-cost network flow problems. The algorithm derives from a theoretical characterization of the network topology of the basis embodied in a specially constructed basis tree. Experimentation with large sparse mini- mum-cost network flow problems has shown that in practice good implemen-tation of the network simplex method is more efficient than other implemen-tations based on special network flow methods.},
author = {Janusz Jabłonowski, Krystian Zorychta},
journal = {Mathematica Applicanda},
keywords = {Programming involving graphs or networks},
language = {eng},
number = {32},
pages = {null},
title = {Primary simplex method for flow network},
url = {http://eudml.org/doc/292998},
volume = {18},
year = {1990},
}

TY - JOUR
AU - Janusz Jabłonowski
AU - Krystian Zorychta
TI - Primary simplex method for flow network
JO - Mathematica Applicanda
PY - 1990
VL - 18
IS - 32
SP - null
AB - This paper describes an efficient network simplex algorithm for solving minimum-cost network flow problems. The algorithm derives from a theoretical characterization of the network topology of the basis embodied in a specially constructed basis tree. Experimentation with large sparse mini- mum-cost network flow problems has shown that in practice good implemen-tation of the network simplex method is more efficient than other implemen-tations based on special network flow methods.
LA - eng
KW - Programming involving graphs or networks
UR - http://eudml.org/doc/292998
ER -