Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems

DOI10.1002/NET.3230040302zbMATH Open0282.68020OpenAlexW2066375037MaRDI QIDQ4768624FDOQ4768624

Authors:

Publication date: 1974

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230040302

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Algorithms in computer science (68W99)

Cites Work

• Title not available (Why is that?)
• A High-Speed Computer Technique for the Transportation Problem

Cited In (41)

• Addressing capacity uncertainty in resource-constrained assignment problems
• My experiences as a student and researcher in OR during the 1960's and 70's
• Optimization with binet matrices
• Experimentation in optimization
• A hybrid algorithm for solving convex separable network flow problems
• Solving embedded generalized network problems
• Network flow problems with one side constraint: A comparison of three solution methods
• A hybrid algorithm for solving network flow problems with side constraints.
• Testing of a large-scale network optimization program
• Computational results of an interior point algorithm for large scale linear programming
• Spatial market equilibrium problems as network models
• A network penalty method
• On the length of simplex paths: The assignment case
• A short discussion of the OR crisis
• A variant of time minimizing assignment problem
• Implementation and analysis of a variant of the dual method for the capacitated transshipment problem
• The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm
• Primal transportation and transshipment algorithms
• The practical conversion of linear programmes to network flow models
• Cost-effective allocations of bounded and binary resources in polynomial time
• The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
• Solving singularly constrained generalized network problems
• The structure of bases in bicircular matroids
• A survey of dynamic network flows
• Performance evaluation of independent superbasic sets on nonlinear replicated networks
• On equivalent representations of certain multicommodity networks as single commodity flow problems
• Network reoptimization procedures for multiobjective network problems
• Solution of large dense transportation problems using a parallel primal algorithm
• Representing inverses in pure network flow optimization
• A genuinely polynomial primal simplex algorithm for the assignment problem
• The alternating basis algorithm for assignment problems
• The multicommodity assignment problem: A network aggregation heuristic
• A comparison of pivot selection rules for primal simplex based network codes
• A decision support system for parking space assignment
• Reoptimization procedures for bounded variable primal simplex network algorithms
• Computational experience with a polynomial-time dual simplex algorithm for the transportation problem
• The generalized alternating path algorithm for transportation problems
• Solution of constrained generalized transportation problems using the pivot and probe algorithm
• An evaluation of mathematical programming and minicomputers
• Experimental comparisons of codes for long transportation problems
• Large-scale linear programming: Geometry, working bases and factorizations

This page was built for publication: Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4768624)