Pivot Strategies for Primal-Simplex Network Codes
From MaRDI portal
Publication:4158842
DOI10.1145/322063.322070zbMath0379.90101MaRDI QIDQ4158842
Publication date: 1978
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322063.322070
Related Items
Unnamed Item, Unnamed Item, An equivalent subproblem relaxation for improving the solution of a class of transportation scheduling problems, A comparison of pivot selection rules for primal simplex based network codes, New labeling procedures for the basis graph in generalized networks, A practical anti-degeneracy row selection technique in network linear programming, A primal simplex variant for the maximum-flow problem, Solving Large Scale Generalized Networks, Primal transportation and transshipment algorithms, Testing of a large-scale network optimization program
Uses Software