Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
From MaRDI portal
Cited in
(36)- Representing inverses in pure network flow optimization
- Levelling terrain trees: A transshipment problem
- An improved bounding procedure for the constrained assignment problem
- Solving singularly constrained generalized network problems
- The generalized alternating path algorithm for transportation problems
- On the use of tree indexing methods in transportation algorithms
- A variant of time minimizing assignment problem
- Efficient parallel algorithms for the minimum cost flow problem
- Solution of constrained generalized transportation problems using the pivot and probe algorithm
- Real-time task reallocation in fault-tolerant distributed computer systems
- Addressing capacity uncertainty in resource-constrained assignment problems
- Minimum-cost flow algorithms: an experimental evaluation
- The continuous multiple-modular design problem
- A heuristic procedure for allocating tasks in fault-tolerant distributed computer systems
- Large-scale linear programming: Geometry, working bases and factorizations
- A forward network simplex algorithm for solving multiperiod network flow problems
- Primal transportation and transshipment algorithms
- Computational experience on an algorithm for the transportation problem with nonlinear objective functions
- An improved version of the out-of-kilter method and a comparative study of computer codes
- Transportation type problems with quantity discounts
- The zero pivot phenomenon in transportation and assignment problems and its computational implications
- Cost operator algorithms for the transportation problem
- Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems
- Solving multicommodity transportation problems using a primal partitioning simplex technique
- The alternating basis algorithm for assignment problems
- Testing of a large-scale network optimization program
- scientific article; zbMATH DE number 4197775 (Why is no real title available?)
- My experiences as a student and researcher in OR during the 1960's and 70's
- A genuinely polynomial primal simplex algorithm for the assignment problem
- A comparison of pivot selection rules for primal simplex based network codes
- An optimal algorithm for the multi-item capacitated production planning problem
- A survey of dynamic network flows
- Network reoptimization procedures for multiobjective network problems
- A surrogate and Lagrangian approach to constrained network problems
- Analysis of relaxations for the multi-item capacitated lot-sizing problem
- Solution of large dense transportation problems using a parallel primal algorithm
This page was built for publication: Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5672168)
