Pages that link to "Item:Q5672168"

The following pages link to Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm (Q5672168):

Displaying 36 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 comparison of pivot selection rules for primal simplex based network codes (Q794141) (← links)
• An optimal algorithm for the multi-item capacitated production planning problem (Q809873) (← links)
• A survey of dynamic network flows (Q917417) (← links)
• Network reoptimization procedures for multiobjective network problems (Q918434) (← links)
• A surrogate and Lagrangian approach to constrained network problems (Q920831) (← links)
• Analysis of relaxations for the multi-item capacitated lot-sizing problem (Q922259) (← links)
• Solution of large dense transportation problems using a parallel primal algorithm (Q922946) (← links)
• Representing inverses in pure network flow optimization (Q1068691) (← links)
• Levelling terrain trees: A transshipment problem (Q1145618) (← links)
• An improved bounding procedure for the constrained assignment problem (Q1184442) (← 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)
• A variant of time minimizing assignment problem (Q1303581) (← links)
• Efficient parallel algorithms for the minimum cost flow problem (Q1379929) (← links)
• Solution of constrained generalized transportation problems using the pivot and probe algorithm (Q1820696) (← links)
• Real-time task reallocation in fault-tolerant distributed computer systems (Q1821015) (← links)
• Addressing capacity uncertainty in resource-constrained assignment problems (Q2566939) (← links)
• Minimum-cost flow algorithms: an experimental evaluation (Q2943810) (← links)
• The continuous multiple-modular design problem (Q3321830) (← links)
• A heuristic procedure for allocating tasks in fault-tolerant distributed computer systems (Q3328229) (← links)
• Large-scale linear programming: Geometry, working bases and factorizations (Q3664825) (← links)
• A forward network simplex algorithm for solving multiperiod network flow problems (Q3731347) (← links)
• Primal transportation and transshipment algorithms (Q3863694) (← links)
• Computational experience on an algorithm for the transportation problem with nonlinear objective functions (Q3872218) (← links)
• An improved version of the out-of-kilter method and a comparative study of computer codes (Q4073126) (← links)
• Transportation type problems with quantity discounts (Q4094670) (← links)
• The zero pivot phenomenon in transportation and assignment problems and its computational implications (Q4127627) (← links)
• Cost operator algorithms for the transportation problem (Q4136922) (← links)
• Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems (Q4149254) (← links)
• Solving multicommodity transportation problems using a primal partitioning simplex technique (Q4154390) (← links)
• The alternating basis algorithm for assignment problems (Q4159200) (← links)
• Testing of a large-scale network optimization program (Q4171521) (← links)
• (Q5202858) (← links)