On solving linear programming problems with embedded network structure

Krystian Zorychta. "On solving linear programming problems with embedded network structure." Mathematica Applicanda 19.33 (1991): null. <http://eudml.org/doc/292821>.

@article{KrystianZorychta1991,
abstract = {A special partitioning algorithm for solving linear programming problems with embed-ded network structure is presented. As an example of such a problem the minimum-cost network flow problem under additional linear constraints can be considered. This algorithm is a primal simplex basis partitioning method that uses special updating and labeling procedures to accelerate computations involving the network linear programming interface. These procedures are discribed in detail to develop an efficient implementation of the method.},
author = {Krystian Zorychta},
journal = {Mathematica Applicanda},
keywords = {Linear programming},
language = {eng},
number = {33},
pages = {null},
title = {On solving linear programming problems with embedded network structure},
url = {http://eudml.org/doc/292821},
volume = {19},
year = {1991},
}

TY - JOUR
AU - Krystian Zorychta
TI - On solving linear programming problems with embedded network structure
JO - Mathematica Applicanda
PY - 1991
VL - 19
IS - 33
SP - null
AB - A special partitioning algorithm for solving linear programming problems with embed-ded network structure is presented. As an example of such a problem the minimum-cost network flow problem under additional linear constraints can be considered. This algorithm is a primal simplex basis partitioning method that uses special updating and labeling procedures to accelerate computations involving the network linear programming interface. These procedures are discribed in detail to develop an efficient implementation of the method.
LA - eng
KW - Linear programming
UR - http://eudml.org/doc/292821
ER -