The zero pivot phenomenon in transportation and assignment problems and its computational implications
From MaRDI portal
Publication:4127627
DOI10.1007/BF01593789zbMATH Open0355.90036OpenAlexW2089845419MaRDI QIDQ4127627FDOQ4127627
Authors: 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
Cites Work
- Title not available (Why is that?)
- A note on two problems in connexion with graphs
- Multicommodity Distribution System Design by Benders Decomposition
- 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
- The Traveling Salesman Problem: A Survey
- A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
- 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
- Title not available (Why is that?)
Cited In (7)
- Solving (large scale) matching problems combinatorially
- An in-core/out-of-core method for solving large scale assignment problems
- Testing of a large-scale network optimization program
- 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
- Foliations and subshifts
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)