Pages that link to "Item:Q4058476"

The following pages link to A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems (Q4058476):

Displaying 28 items.

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