A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems

DOI10.1287/mnsc.20.5.783zbMath0303.90039OpenAlexW2031763823MaRDI QIDQ4058476

No author found.

Publication date: 1974

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.20.5.783

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Linear programming (90C05)

Related Items

The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm, A tabu thresholding algorithm for arc crossing minimization in bipartite graphs, Efficient parallel algorithms for the minimum cost flow problem, Designing and reporting on computational experiments with heuristic methods, Minimum-cost flow algorithms: an experimental evaluation, Implementation and analysis of a variant of the dual method for the capacitated transshipment problem, Relax-and-fix heuristics applied to a real-world lot sizing and scheduling problem in the personal care consumer goods industry, The structure of bases in bicircular matroids, On the equivalence of some generalized network problems to pure network problems, A survey of dynamic network flows, Parallel arc-allocation algorithms for optimizing generalized networks, An improved version of the out-of-kilter method and a comparative study of computer codes, A fuzzy transportation algorithm, The factorization approach to large-scale linear programming, A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints, EXPERIMENTAL ANALYSIS OF SOME VARIANTS OF VOGEL'S APPROXIMATION METHOD, The zero pivot phenomenon in transportation and assignment problems and its computational implications, Primal transportation and transshipment algorithms, The alternating basis algorithm for assignment problems, Solving singularly constrained generalized network problems, The generalized alternating path algorithm for transportation problems, On the use of tree indexing methods in transportation algorithms, An evaluation of mathematical programming and minicomputers, An algorithm for then×n optimum assignment problem, BRIDGE LANE DIRECTION SPECIFICATION FOR SUSTAINABLE TRAFFIC MANAGEMENT, The biobjective minimum cost flow problem, Reoptimization procedures for bounded variable primal simplex network algorithms, A partial dual algorithm for the capacitated warehouse location problem