The zero pivot phenomenon in transportation and assignment problems and its computational implications
From MaRDI portal
Publication:4127627
Cites work
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3319182 (Why is no real title available?)
- A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
- A note on two problems in connexion with graphs
- Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
- Implementation and Computational Study on an In-Core, Out-of-Core Primal Network Code
- Multicommodity Distribution System Design by Benders Decomposition
- Real World Applications of Network Related Problems and Breakthroughs in Solving Them Efficiently
- Solving the Fixed Charge Problem by Ranking the Extreme Points
- The Transportation-Location Problem
- The Traveling Salesman Problem: A Survey
Cited in
(7)- A comprehensive simplex-like algorithm for network optimization and perturbation analysis
- Primal transportation and transshipment algorithms
- An approach for solving a class of transportation scheduling problems
- Solving (large scale) matching problems combinatorially
- Foliations and subshifts
- Testing of a large-scale network optimization program
- An in-core/out-of-core method for solving large scale assignment problems
This page was built for publication: The zero pivot phenomenon in transportation and assignment problems and its computational implications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4127627)