Pages that link to "Item:Q4768624"

The following pages link to Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems (Q4768624):

Displaying 41 items.

• My experiences as a student and researcher in OR during the 1960's and 70's (Q537599) (← links)
• A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416) (← links)
• A short discussion of the OR crisis (Q721666) (← links)
• The practical conversion of linear programmes to network flow models (Q757237) (← links)
• A comparison of pivot selection rules for primal simplex based network codes (Q794141) (← links)
• A decision support system for parking space assignment (Q806802) (← links)
• The structure of bases in bicircular matroids (Q912110) (← links)
• A survey of dynamic network flows (Q917417) (← links)
• Network reoptimization procedures for multiobjective network problems (Q918434) (← links)
• Solution of large dense transportation problems using a parallel primal algorithm (Q922946) (← links)
• Solving embedded generalized network problems (Q1058978) (← links)
• Reoptimization procedures for bounded variable primal simplex network algorithms (Q1066818) (← links)
• Performance evaluation of independent superbasic sets on nonlinear replicated networks (Q1068689) (← links)
• Representing inverses in pure network flow optimization (Q1068691) (← links)
• Spatial market equilibrium problems as network models (Q1072912) (← links)
• Computational experience with a polynomial-time dual simplex algorithm for the transportation problem (Q1072935) (← links)
• Experimentation in optimization (Q1084342) (← links)
• Experimental comparisons of codes for long transportation problems (Q1086155) (← links)
• Network flow problems with one side constraint: A comparison of three solution methods (Q1102172) (← links)
• Implementation and analysis of a variant of the dual method for the capacitated transshipment problem (Q1143947) (← links)
• The multicommodity assignment problem: A network aggregation heuristic (Q1147630) (← links)
• Cost-effective allocations of bounded and binary resources in polynomial time (Q1168898) (← links)
• A network penalty method (Q1174423) (← links)
• Computational results of an interior point algorithm for large scale linear programming (Q1181915) (← links)
• Solving singularly constrained generalized network problems (Q1245161) (← links)
• The generalized alternating path algorithm for transportation problems (Q1245652) (← links)
• An evaluation of mathematical programming and minicomputers (Q1250035) (← links)
• A variant of time minimizing assignment problem (Q1303581) (← links)
• A hybrid algorithm for solving network flow problems with side constraints. (Q1406684) (← links)
• Solution of constrained generalized transportation problems using the pivot and probe algorithm (Q1820696) (← links)
• The transportation problem with exclusionary side constraints and two branch-and-bound algorithms (Q1848594) (← links)
• Optimization with binet matrices (Q2467475) (← links)
• Addressing capacity uncertainty in resource-constrained assignment problems (Q2566939) (← links)
• Large-scale linear programming: Geometry, working bases and factorizations (Q3664825) (← links)
• On the length of simplex paths: The assignment case (Q3698637) (← links)
• A hybrid algorithm for solving convex separable network flow problems (Q3706799) (← links)
• Primal transportation and transshipment algorithms (Q3863694) (← links)
• The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm (Q3967334) (← links)
• The alternating basis algorithm for assignment problems (Q4159200) (← links)
• Testing of a large-scale network optimization program (Q4171521) (← links)
• On equivalent representations of certain multicommodity networks as single commodity flow problems (Q4174500) (← links)