Pivot Strategies for Primal-Simplex Network Codes

Authors:
John M. Mulvey
Affiliations:
Graduate School of Business Administration, Harvard University, Boston, MA
Venue:
Journal of the ACM (JACM)
Year:
1978

Citing 4
Cited 9

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems

Journal of the ACM (JACM)
Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm

Journal of the ACM (JACM)
A Code for the Transportation Problem of Linear Programming

Journal of the ACM (JACM)

An improved primal simplex variant for pure processing networks

ACM Transactions on Mathematical Software (TOMS)
A Subtree-Partitioning Algorithm for Inducing Parallelism in Network Simplex Dual Updates

Computational Optimization and Applications
Clustering for faster network simplex pivots

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Solving Two-Commodity Transportation Problems with Coupling Constraints

Journal of the ACM (JACM)
Warm-Start Routines for Solving Augmented Weighted Tchebycheff Network Programs in Multiple-Objective Network Programming

INFORMS Journal on Computing
Minimal-cost network flow problems with variable lower bounds on arc flows

Computers and Operations Research
A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminals

Computers & Mathematics with Applications
A comparison of pivot selection rules for primal simplex based network codes

Operations Research Letters
New labeling procedures for the basis graph in generalized networks

Operations Research Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract