Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
From MaRDI portal
Publication:4768624
DOI10.1002/net.3230040302zbMath0282.68020OpenAlexW2066375037MaRDI QIDQ4768624
No author found.
Publication date: 1974
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230040302
Related Items (41)
On the length of simplex paths: The assignment case ⋮ The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm ⋮ Experimentation in optimization ⋮ A hybrid algorithm for solving convex separable network flow problems ⋮ Experimental comparisons of codes for long transportation problems ⋮ Network flow problems with one side constraint: A comparison of three solution methods ⋮ Implementation and analysis of a variant of the dual method for the capacitated transshipment problem ⋮ The multicommodity assignment problem: A network aggregation heuristic ⋮ A hybrid algorithm for solving network flow problems with side constraints. ⋮ The structure of bases in bicircular matroids ⋮ A survey of dynamic network flows ⋮ Network reoptimization procedures for multiobjective network problems ⋮ Solution of large dense transportation problems using a parallel primal algorithm ⋮ Cost-effective allocations of bounded and binary resources in polynomial time ⋮ A network penalty method ⋮ Computational results of an interior point algorithm for large scale linear programming ⋮ Optimization with binet matrices ⋮ A genuinely polynomial primal simplex algorithm for the assignment problem ⋮ My experiences as a student and researcher in OR during the 1960's and 70's ⋮ Primal transportation and transshipment algorithms ⋮ A short discussion of the OR crisis ⋮ The alternating basis algorithm for assignment problems ⋮ Solving singularly constrained generalized network problems ⋮ The generalized alternating path algorithm for transportation problems ⋮ An evaluation of mathematical programming and minicomputers ⋮ Testing of a large-scale network optimization program ⋮ On equivalent representations of certain multicommodity networks as single commodity flow problems ⋮ The practical conversion of linear programmes to network flow models ⋮ Solution of constrained generalized transportation problems using the pivot and probe algorithm ⋮ Addressing capacity uncertainty in resource-constrained assignment problems ⋮ Large-scale linear programming: Geometry, working bases and factorizations ⋮ The transportation problem with exclusionary side constraints and two branch-and-bound algorithms ⋮ A variant of time minimizing assignment problem ⋮ A comparison of pivot selection rules for primal simplex based network codes ⋮ Solving embedded generalized network problems ⋮ A decision support system for parking space assignment ⋮ Reoptimization procedures for bounded variable primal simplex network algorithms ⋮ Performance evaluation of independent superbasic sets on nonlinear replicated networks ⋮ Representing inverses in pure network flow optimization ⋮ Spatial market equilibrium problems as network models ⋮ Computational experience with a polynomial-time dual simplex algorithm for the transportation problem
Cites Work
This page was built for publication: Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
