Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
From MaRDI portal
Publication:5672168
DOI10.1145/321752.321754zbMath0257.68034OpenAlexW2037209059MaRDI QIDQ5672168
No author found.
Publication date: 1973
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321752.321754
Related Items
Unnamed Item, A forward network simplex algorithm for solving multiperiod network flow problems, Efficient parallel algorithms for the minimum cost flow problem, Minimum-cost flow algorithms: an experimental evaluation, Levelling terrain trees: A transshipment problem, A survey of dynamic network flows, Network reoptimization procedures for multiobjective network problems, A surrogate and Lagrangian approach to constrained network problems, Analysis of relaxations for the multi-item capacitated lot-sizing problem, An improved version of the out-of-kilter method and a comparative study of computer codes, Solution of large dense transportation problems using a parallel primal algorithm, An improved bounding procedure for the constrained assignment problem, Transportation type problems with quantity discounts, A genuinely polynomial primal simplex algorithm for the assignment problem, The continuous multiple-modular design problem, A heuristic procedure for allocating tasks in fault-tolerant distributed computer systems, My experiences as a student and researcher in OR during the 1960's and 70's, The zero pivot phenomenon in transportation and assignment problems and its computational implications, Cost operator algorithms for the transportation problem, Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems, Primal transportation and transshipment algorithms, Solving multicommodity transportation problems using a primal partitioning simplex technique, The alternating basis algorithm for assignment problems, Computational experience on an algorithm for the transportation problem with nonlinear objective functions, Solving singularly constrained generalized network problems, The generalized alternating path algorithm for transportation problems, On the use of tree indexing methods in transportation algorithms, Testing of a large-scale network optimization program, Solution of constrained generalized transportation problems using the pivot and probe algorithm, Real-time task reallocation in fault-tolerant distributed computer systems, Addressing capacity uncertainty in resource-constrained assignment problems, Large-scale linear programming: Geometry, working bases and factorizations, A variant of time minimizing assignment problem, A comparison of pivot selection rules for primal simplex based network codes, Representing inverses in pure network flow optimization, An optimal algorithm for the multi-item capacitated production planning problem
