×
Armstrong, Ronald D.; Klingman, Darwin; Whitman, David

Implementation and analysis of a variant of the dual method for the capacitated transshipment problem. (English) Zbl 0442.90100

Eur. J. Oper. Res. 4, 403-420 (1980).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0442.90100

Cited in 2 Documents

MSC:

90C35 Programming involving graphs or networks
65K05 Numerical mathematical programming methods

Keywords:

implementation; capacitated transshipment problem; dual simplex method; capacitated pure network problem; computational analysis; sensitivity of the implementation; algorithmic performance

Software:

NETGEN
Cite Review PDF
Full Text: DOI

References:

[1] Balas, E.; Zemel, E., Solving Large Zero-One Knapsack Problems, (Management Sciences Report No. 408 (June 1976), Graduate School of Industrial Administration, Carnegie-Mellon University: Graduate School of Industrial Administration, Carnegie-Mellon University Pittsburgh), Reused July 1977
[2] R.S. Barr, J. Elam, F. Glover and D. Klingman, A Network Augmenting Path Basis Algorithm for Transshipment Problems.; R.S. Barr, J. Elam, F. Glover and D. Klingman, A Network Augmenting Path Basis Algorithm for Transshipment Problems. · Zbl 0428.90070
[3] Barr, R. S.; Glover, F.; Klingman, D., An improved version version of the out-of-kilter method and a comparative study of computer codes, Mathematical Programming, 7, 60-86 (1974) · Zbl 0313.90044
[4] Barrodale, I.; Roberts, F. D.K., An improved algorithm for discrete \(L_1\) linear approximation, SIAM Journal of Numerical Analysis, 10, 839-848 (1973) · Zbl 0266.65016
[5] Charnes, A.; Cooper, W. W., Management Models and Industrial Applications of Linear Programming, ((1961), Wiley: Wiley New York), 2 vols. · Zbl 0995.90552
[6] Dantzig, G., Linear Programming and Extensions (1963), Princeton University Press: Princeton University Press Princeton, N.J · Zbl 0108.33103
[7] Dial, R.; Glover, F.; Karney, D.; Klingman, D., A computational Analysis of Alternative Algorithms and Labeling Techniques for finding Shortest Path Trees, (Research Report CCS291 (1977), Center for Cybernetic Studies, University of Texas: Center for Cybernetic Studies, University of Texas Austin), To appear in Networks · Zbl 0414.68035
[8] Gilsinn, J.; Witzgall, C., A performance comparison of labeling algorithms for calculating shortest path trees, (NBS Technical Note 772 (1973), U.S. Department of Commerce)
[9] Glover, F.; Hultz, J.; Klingman, D., Generalized networks: a fundamental computer-based planning tool, Management Science, 24, 12, 1209-1220 (1978)
[10] Glover, F.; Karney, D.; Klingman, D., The augmented predecessor index method for locating stepping stones paths and assigning dual prices in distribution problems, Transportation Science, 6, 1, 171-180 (1972)
[11] Glover, F.; Karney, D.; Klingman, D., Double-Pricing Dual and Feasible Start Algorithms for the Capacitated Transportation (Distribution) Problem, (Research Report CCS105 (1973), Center for Cybernetic Studies, University of Texas: Center for Cybernetic Studies, University of Texas Austin) · Zbl 0282.68020
[12] Glover, F.; Karney, D.; Klingman, D., Implementation and computational comparisons of primal, dual, and primal-dual computer codes for minimum cost network flow problems, Networks, 4, 3, 191-212 (1974) · Zbl 0282.68020
[13] Glover, F.; Karney, D.; Klingman, D.; Napier, A., A computational study on start procedures, basic change criteria, and solution algorithms for transportation problems, Management Science, 20, 5, 793-813 (1974) · Zbl 0303.90039
[14] Glover, F.; Klingman, D.; Stutz, J., Augmented threaded index method for network optimization, INFOR, 12, 3, 293-298 (1974) · Zbl 0288.90077
[15] Hultz, J.; Klingman, D.; Russell, R., An advanced dual basic feasible solution for a class of capacitated generalized networks, Operations Research, 24, 2, 301-313 (1976) · Zbl 0362.90124
[16] Jacobsen, S. K., On the use of tree indexing methods in transportation algorithms, European Journal of Operational Research, 2, 1, 54-65 (1978) · Zbl 0381.90095
[17] Johnson, E., Networks and Basic Solutions, Operations Research, 14, 619-623 (1966)
[18] Klingman, D.; Napier, A.; Stutz, J., NETGEN- A program for generating large scale (un) capacitated assignment, transportation, and minimum cost flow network problems, Management Science, 20, 5, 814-821 (1974) · Zbl 0303.90042
[19] Wagner, H., The dual simplex algorithm for bounded variables, Naval Research Logistics Quarterly, 5, 3, 257-261 (1958)
[20] Witzgall, C., On One-Row Linear Programs, (International Symposium on Extremal Methods and Systems Analysis on the Occasion of Professor A. Charnes’ 60th Birthday (1977), University of Texas: University of Texas Austin) · Zbl 0428.90034
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.