The zero pivot phenomenon in transportation and assignment problems and its computational implications
From MaRDI portal
Publication:4127627
DOI10.1007/BF01593789zbMath0355.90036OpenAlexW2089845419MaRDI QIDQ4127627
Bezalel Gavish, E. Shlifer, Paul J. Schweitzer
Publication date: 1977
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01593789
Related Items
Foliations and subshifts, An in-core/out-of-core method for solving large scale assignment problems, Primal transportation and transshipment algorithms, Testing of a large-scale network optimization program, An approach for solving a class of transportation scheduling problems, Solving (large scale) matching problems combinatorially, A comprehensive simplex-like algorithm for network optimization and perturbation analysis
Cites Work
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
- Multicommodity Distribution System Design by Benders Decomposition
- Real World Applications of Network Related Problems and Breakthroughs in Solving Them Efficiently
- Implementation and Computational Study on an In-Core, Out-of-Core Primal Network Code
- The Traveling Salesman Problem: A Survey
- The Transportation-Location Problem
- Solving the Fixed Charge Problem by Ranking the Extreme Points
- Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm