{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,19]],"date-time":"2024-07-19T04:33:16Z","timestamp":1721363596695},"reference-count":70,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1980,2,1]],"date-time":"1980-02-01T00:00:00Z","timestamp":318211200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Zeitschrift f\u00fcr Operations Research"],"published-print":{"date-parts":[[1980,2]]},"DOI":"10.1007\/bf01920269","type":"journal-article","created":{"date-parts":[[2005,7,23]],"date-time":"2005-07-23T12:04:14Z","timestamp":1122120254000},"page":"1-32","source":"Crossref","is-referenced-by-count":9,"title":["Primal transportation and transshipment algorithms"],"prefix":"10.1007","volume":"24","author":[{"given":"J. H.","family":"Ahrens","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Finke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01920269_CR1","unstructured":"Ahrens, J.H.: Counting Basic Feasible Solutions of Transportation Problems. Methods of Operations Research. Proc. III Symposium on Ops. Res., 1978."},{"key":"BF01920269_CR2","unstructured":"-: A Conjecture of E.D. Bolker. To appear."},{"key":"BF01920269_CR3","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1002\/net.3230080405","volume":"8","author":"A.I. Ali","year":"1978","unstructured":"Ali, A.I., R. V. Helgason, J.L. Kennington andH.S. Lall: Primal Simplex Network Codes: State-of-the-Art Implementation Technology. Networks8, 1978, 315\u2013339.","journal-title":"Networks"},{"issue":"2","key":"BF01920269_CR4","first-page":"98","volume":"4","author":"E. Balas","year":"1962","unstructured":"Balas, E., andP.L. Hammer: On the Transportation Problem \u2014 Part 1. Cahiers du Centre d'Etudes de Recherche Op\u00e9rationelle4 (2), 1962, 98\u2013116.","journal-title":"Cahiers du Centre d'Etudes de Recherche Op\u00e9rationelle"},{"key":"BF01920269_CR5","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BFb0121240","volume":"1","author":"M.L. Balinski","year":"1974","unstructured":"Balinski, M.L.: On Two Special Classes of Transportation Polytopes. Math. Prog. Study1, 1974, 43\u201358.","journal-title":"Math. Prog. Study"},{"issue":"1","key":"BF01920269_CR6","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/BF01585504","volume":"7","author":"R.S. Barr","year":"1974","unstructured":"Barr, R.S., F. Glover andD. Klingman: An Improved Version of the Out-of-Kilter Method and a Comparative Study of Computer Codes. Math. Prog.7 (1), 1974, 60\u201386.","journal-title":"Math. Prog."},{"issue":"1","key":"BF01920269_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01584319","volume":"13","author":"R.S. Barr","year":"1977","unstructured":"\u2014: The Alternating Basis Algorithm for Assignment Problems. Math. Prog.13 (1), 1977, 1\u201313.","journal-title":"Math. Prog."},{"key":"BF01920269_CR8","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0377-2217(78)90110-8","volume":"2","author":"R.S. Barr","year":"1978","unstructured":"\u2014: The Generalized Alternating Path Algorithm for Transportation Problems. European Journal of Ops. Res.2, 1978, 137\u2013144.","journal-title":"European Journal of Ops. Res."},{"issue":"1","key":"BF01920269_CR9","first-page":"16","volume":"17","author":"R.S. Barr","year":"1979","unstructured":"\u2014: Enhancements of Spanning Tree Labelling Procedures for Network Optimization. INFOR17 (1), 1979, 16\u201334.","journal-title":"INFOR"},{"key":"BF01920269_CR10","unstructured":"Bazaraa, M.S., andJ.J. Jarvis: Linear Programming and Network Flows. New York 1977."},{"issue":"9","key":"BF01920269_CR11","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1287\/mnsc.19.9.1042","volume":"19","author":"G.E. Bennington","year":"1973","unstructured":"Bennington, G.E.: An Efficient Minimal Cost Flow Algorithm. Man. Sci.19 (9), 1973, 1042\u20131051.","journal-title":"Man. Sci."},{"issue":"2","key":"BF01920269_CR12","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1287\/moor.2.2.103","volume":"2","author":"R.G. Bland","year":"1977","unstructured":"Bland, R.G.: New Finite Pivoting Rules for the Simplex Method. Math. of Ops. Res.2 (2), 1977, 103\u2013107.","journal-title":"Math. of Ops. Res."},{"key":"BF01920269_CR13","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0095-8956(72)90060-3","volume":"13","author":"E.D. Bolker","year":"1972","unstructured":"Bolker, E.D.: Transportation Polytopes. J. Comb. Theory (B)13, 1972, 251\u2013262.","journal-title":"J. Comb. Theory (B)"},{"issue":"1","key":"BF01920269_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.24.1.1","volume":"24","author":"G.H. Bradley","year":"1977","unstructured":"Bradley, G.H., G.G. Brown andG.W. Graves: Design and Implementation of Large Scale Primal Transshipment Algorithms. Man. Sci.24 (1), 1977, 1\u201334.","journal-title":"Man. Sci."},{"key":"BF01920269_CR15","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0305-0548(78)90035-7","volume":"5","author":"A. Brandt","year":"1978","unstructured":"Brandt, A., andJ. Intrator: Fast Algorithms for Long Transportation Problems. Comp. & Ops. Res.5, 1978, 263\u2013271.","journal-title":"Comp. & Ops. Res."},{"key":"BF01920269_CR16","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0012-365X(78)90055-9","volume":"22","author":"R.E. Burkard","year":"1978","unstructured":"Burkard, R.E.: A General Hungarian Method for the Algebraic Transportation Problem. Discrete Math.22, 1978, 219\u2013232.","journal-title":"Discrete Math."},{"key":"BF01920269_CR17","doi-asserted-by":"crossref","unstructured":"Busacker, R.G., andP.J. Gowen: A Procedure for Determining a Family of Minimum-Cost Flow Patterns. ORO Technical Report15, Ops. Res. Office, John Hopkins University, 1961.","DOI":"10.21236\/AD0249662"},{"key":"BF01920269_CR18","unstructured":"Charnes, A., andW.W. Cooper: Management Models and Industrial Applications of Linear Programming. Vol. I and II. New York 1961."},{"key":"BF01920269_CR19","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/nav.3800180211","volume":"18","author":"A. Charnes","year":"1971","unstructured":"Charnes, A., F. Glover andD. Klingman: The Lower Bounded and Partial Upper Bounded Distribution Model. NRLQ18, 1971, 277\u2013281.","journal-title":"NRLQ"},{"key":"BF01920269_CR20","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0305-0548(75)90010-6","volume":"2","author":"A. Charnes","year":"1975","unstructured":"Charnes, A., D. Karney, D. Klingman, J. Stutz andF. Glover: Past, Present and Future of Large Scale Transshipment Computer Codes and Applications. Comp. and Ops. Res.2, 1975, 71\u201381.","journal-title":"Comp. and Ops. Res."},{"key":"BF01920269_CR21","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01580379","volume":"11","author":"W.H. Cunningham","year":"1976","unstructured":"Cunningham, W.H.: A Network Simplex Method. Math. Prog.11, 1976, 105\u2013116.","journal-title":"Math. Prog."},{"key":"BF01920269_CR22","unstructured":"Dantzig, G.B.: Application of the Simplex Method to a Transportation Problem. Activity Analysis of Production and Allocation. Ed. by T.C. Koopmans. New York 1951."},{"key":"BF01920269_CR23","unstructured":"-: Linear Programming and Extensions. Princeton, New Jersey, 1963."},{"key":"BF01920269_CR24","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1145\/320924.320927","volume":"5","author":"J.B. Dennis","year":"1958","unstructured":"Dennis, J.B.: A High-Speed Computer Technique for the Transportation Problem. J. ACM5, 1958, 132\u2013153.","journal-title":"J. ACM"},{"issue":"4","key":"BF01920269_CR25","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF02252026","volume":"19","author":"U. Derigs","year":"1978","unstructured":"Derigs, U., andU. Zimmermann: An Augmenting Path Method for Solving Linear Bottleneck Assignment Problems. Computing19 (4), 1978, 285\u2013295.","journal-title":"Computing"},{"key":"BF01920269_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02246556","volume":"22","author":"U. Derigs","year":"1979","unstructured":"\u2014: An Augmenting Path Method For Solving Linear Bottleneck Transportation Problems. Computing22, 1979, 1\u201315.","journal-title":"Computing"},{"key":"BF01920269_CR27","unstructured":"D\u00f6m\u00f6lky, B., andS. Frivaldszky: Solving the Transportation Problem by Means of Graph Representation (in Hungarian). Inform\u00e1ci\u00f3-Elektronika, 1966, 47\u201349."},{"key":"BF01920269_CR28","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1002\/nav.3800220410","volume":"22","author":"P.S. Dwyer","year":"1975","unstructured":"Dwyer, P.S.: Transportation Problems with Some xij Negative and Transshipment Problems. NRLQ22, 1975, 751\u2013776.","journal-title":"NRLQ"},{"key":"BF01920269_CR29","doi-asserted-by":"crossref","unstructured":"Finke, G.: A Unified Approach to Reshipment, Overshipment and Post-Optimization Problems. Lecture Notes in Control and Information Sciences. Vol. 7, Optimization Techniques, Part 2. Berlin 1978, 201\u2013208.","DOI":"10.1007\/BFb0006524"},{"issue":"1","key":"BF01920269_CR30","first-page":"35","volume":"16","author":"G. Finke","year":"1978","unstructured":"Finke, G., andJ.H. Ahrens: A Variant of the Primal Transportation Algorithm. INFOR16 (1), 1978, 35\u201346.","journal-title":"INFOR"},{"key":"BF01920269_CR31","first-page":"185","volume":"31","author":"G. Finke","year":"1978","unstructured":"Finke, G., andP.A. Smith: Primal Equivalents to the Threshold Algorithm. Methods of Operations Research31, 1978, 185\u2013198.","journal-title":"Methods of Operations Research"},{"key":"BF01920269_CR32","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1002\/nav.3800080308","volume":"8","author":"M.M. Flood","year":"1961","unstructured":"Flood, M.M.: A Transportation Algorithm and Code. NRLQ8, 1961, 257\u2013276.","journal-title":"NRLQ"},{"issue":"1","key":"BF01920269_CR33","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1002\/nav.3800040109","volume":"4","author":"L.R. Ford","year":"1957","unstructured":"Ford, L.R., andD.R. Fulkerson: A Primal-Dual Algorithm for the Capacitated Hitchcock Problem. NRLQ4 (1), 1957, 47\u201354.","journal-title":"NRLQ"},{"key":"BF01920269_CR34","unstructured":"-: Flows in Networks. Princeton, New Jersey, 1962."},{"issue":"1","key":"BF01920269_CR35","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1137\/0109002","volume":"9","author":"D.R. Fulkerson","year":"1961","unstructured":"Fulkerson, D.R.: An Out-of-Kilter Method for Minimal-Cost Flow Problems. SIAM J. Appl. Math.9 (1), 1961, 18\u201327.","journal-title":"SIAM J. Appl. Math."},{"key":"BF01920269_CR36","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1002\/nav.3800110104","volume":"11","author":"B.J. Gassner","year":"1964","unstructured":"Gassner, B.J.: Cycling in the Transportation Problem. NRLQ11, 1964, 43\u201358.","journal-title":"NRLQ"},{"key":"BF01920269_CR37","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/BF01593789","volume":"12","author":"B. Gavish","year":"1977","unstructured":"Gavish, B., P. Schweitzer andE. Shlifer: The Zero Pivot Phenomenon in Transportation and Assignment Problems and its Computational Implications. Math. Prog.12, 1977, 226\u2013240.","journal-title":"Math. Prog."},{"issue":"2","key":"BF01920269_CR38","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1002\/nav.3800070206","volume":"7","author":"S. Glicksman","year":"1960","unstructured":"Glicksman, S., L. Johnson andL. Eselson: Coding the Transportation Problem. NRLQ7 (2), 1960, 169\u2013183.","journal-title":"NRLQ"},{"key":"BF01920269_CR39","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1287\/trsc.6.2.171","volume":"6","author":"F. Glover","year":"1972","unstructured":"Glover, F., D. Karney andD. Klingman: The Augmented Predecessor Index Method for Locating Stepping-Stone Paths and Assigning Dual Prices in Distribution Problems. Transp. Sci.6, 1972, 171\u2013180.","journal-title":"Transp. Sci."},{"issue":"3","key":"BF01920269_CR40","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1002\/net.3230040302","volume":"4","author":"F. Glover","year":"1974","unstructured":"\u2014: Implementation and Computational Comparisons of Primal, Dual and Primal-Dual Computer Codes for Minimum Cost Network Flow Problems. Networks4 (3), 1974, 191\u2013212.","journal-title":"Networks"},{"issue":"5","key":"BF01920269_CR41","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1287\/mnsc.20.5.783","volume":"20","author":"F. Glover","year":"1974","unstructured":"Glover, F., D. Karney, D. Klingman andA. Napier: A Computational Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems. Man. Sci.20 (5), 1974, 793\u2013813.","journal-title":"Man. Sci."},{"key":"BF01920269_CR42","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1287\/trsc.4.2.220","volume":"4","author":"F. Glover","year":"1970","unstructured":"Glover, F., andD. Klingman: Locating Stepping-Stone Paths in Distribution Problems Via the Predecessor Index Method. Transp. Sci.4, 1970, 220\u2013226.","journal-title":"Transp. Sci."},{"issue":"3","key":"BF01920269_CR43","first-page":"293","volume":"12","author":"F. Glover","year":"1974","unstructured":"Glover, F., D. Klingman andJ. Stutz: Augmented Threaded Index Method for Network Optimization. INFOR12 (3), 1974, 293\u2013298.","journal-title":"INFOR"},{"key":"BF01920269_CR44","unstructured":"Hadley, G.F.: Linear Programming. Reading 1962."},{"key":"BF01920269_CR45","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1145\/321921.321937","volume":"23","author":"B. Harris","year":"1976","unstructured":"Harris, B.: A Code for the Transportation Problem of Linear Programming. J. ACM23, 1976, 155\u2013157.","journal-title":"J. ACM"},{"issue":"4","key":"BF01920269_CR46","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1287\/trsc.12.4.271","volume":"12","author":"B. Harris","year":"1978","unstructured":"\u2014: A New Algorithm for Tree Modification in the Primal Transportation Problem. Transp. Sci.12 (4), 1978, 271\u2013276.","journal-title":"Transp. Sci."},{"key":"BF01920269_CR47","doi-asserted-by":"crossref","unstructured":"Hausmann, D. (ed.): Lecture Notes in Economies and Mathematical System. Vol. 160, Integer Programming and Related Areas. A Classified Bibliography 1976\u20131978. Berlin-Heidelberg 1978.","DOI":"10.1007\/978-3-642-46383-9"},{"key":"BF01920269_CR48","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1002\/sapm1941201224","volume":"20","author":"F.L. Hitchcock","year":"1941","unstructured":"Hitchcock, F.L.: The Distribution of a Product from Several Sources to Numerous Localities. J. Math. Phys.20, 1941, 224\u2013230.","journal-title":"J. Math. Phys."},{"key":"BF01920269_CR49","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/0377-2217(78)90124-8","volume":"2","author":"S.K. Jacobsen","year":"1978","unstructured":"Jacobsen, S.K.: On the Use of Tree-Indexing Methods in Transportation Algorithms. European J. Ops. Res.2, 1978, 54\u201365.","journal-title":"European J. Ops. Res."},{"issue":"4","key":"BF01920269_CR50","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1287\/opre.14.4.619","volume":"14","author":"E. Johnson","year":"1966","unstructured":"Johnson, E.: Networks and Basic Solutions. Ops. Res.14 (4), 1966, 619\u2013623.","journal-title":"Ops. Res."},{"key":"BF01920269_CR51","first-page":"199","volume":"37","author":"L. V. Kantorovich","year":"1942","unstructured":"Kantorovich, L. V.: On the Translocation of Masses. Compt. rendu. Acad. Sci., U.S.S.R.37, 1942. 199\u2013201.","journal-title":"Acad. Sci., U.S.S.R."},{"issue":"6","key":"BF01920269_CR52","doi-asserted-by":"crossref","first-page":"1056","DOI":"10.1287\/opre.24.6.1056","volume":"24","author":"D. Karney","year":"1976","unstructured":"Karney, D., andD. Klingman: Implementation and Computational Study on an In-Core, Out-of-Core Primal Network Code. Ops. Res.24 (6), 1976, 1056\u20131077.","journal-title":"Ops. Res."},{"key":"BF01920269_CR53","doi-asserted-by":"crossref","unstructured":"Kastning, C. (ed.): Lecture Notes in Economics and Mathematical Systems. Vol. 128, Integer Programming and Related Areas. A Classified Bibliography 1976. Berlin-Heidelberg 1976.","DOI":"10.1007\/978-3-662-02284-9"},{"issue":"5","key":"BF01920269_CR54","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1287\/mnsc.20.5.814","volume":"20","author":"D. Klingman","year":"1974","unstructured":"Klingman, D., A. Napier andJ. Stutz: Netgen: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems. Man. Sci.20 (5), 1974, 814\u2013821.","journal-title":"Man. Sci."},{"key":"BF01920269_CR55","unstructured":"Knuth, D.E.: The Art of Computer Programming. Vol. 1. Reading 1968a."},{"key":"BF01920269_CR56","doi-asserted-by":"crossref","first-page":"1077","DOI":"10.4153\/CJM-1968-104-8","volume":"20","author":"D.E. Knuth","year":"1968","unstructured":"\u2014: Another Enumeration of Trees. Can. J. Math.20, 1968b, 1077\u20131086.","journal-title":"Can. J. Math."},{"key":"BF01920269_CR57","doi-asserted-by":"crossref","unstructured":"Koopmans, T.C.: Optimum Utilization of the Transportation System. Proc. Int. Stat. Conf., Vol. 5. Washington, D.C., 1949.","DOI":"10.2307\/1907301"},{"issue":"4","key":"BF01920269_CR58","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1002\/nav.3800210407","volume":"21","author":"R.W. Langley","year":"1974","unstructured":"Langley, R.W., J.L. Kennington andC.M. Shetty: Efficient Computational Devices for the Capacitated Transportation Problem. NRLQ21 (4), 1974, 637\u2013647.","journal-title":"NRLQ"},{"issue":"2","key":"BF01920269_CR59","first-page":"49","volume":"8","author":"H. M\u00fcller-Merbach","year":"1966","unstructured":"M\u00fcller-Merbach, H.: Die L\u00f6sung des Transportproblems auf Rechenautomaten \u2014 Ein Algol-Program. Elektronische Datenverarbeitung8 (2), 1966, 49\u201356.","journal-title":"Elektronische Datenverarbeitung"},{"issue":"2","key":"BF01920269_CR60","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1145\/322063.322070","volume":"25","author":"J.M. Mulvey","year":"1978","unstructured":"Mulvey, J.M.: Pivot Strategies for Primal-Simplex Network Codes. J. ACM25 (2), 1978, 266\u2013270.","journal-title":"J. ACM"},{"key":"BF01920269_CR61","unstructured":"Murty, K.G.: Linear and Combinatorial Programming. New York 1976."},{"issue":"3","key":"BF01920269_CR62","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1287\/mnsc.2.3.276","volume":"2","author":"A. Orden","year":"1956","unstructured":"Orden, A.: The Transshipment Problem. Man. Sci.2 (3), 1956, 276\u2013285.","journal-title":"Man. Sci."},{"key":"BF01920269_CR63","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1002\/nav.3800180404","volume":"18","author":"M.R. Rao","year":"1971","unstructured":"Rao, M.R., andR.S. Garfinkel: The Bottleneck Transportation Problem. NRLQ18, 1971, 465\u2013472.","journal-title":"NRLQ"},{"key":"BF01920269_CR64","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1145\/321892.321903","volume":"22","author":"G. T. Ross","year":"1975","unstructured":"Ross, G. T., D. Klingman andA. Napier: A Computational Study of the Effects of Problem Dimensions on Solution Times of Transportation Problems. J. ACM22, 1975, 413\u2013424.","journal-title":"J. ACM"},{"key":"BF01920269_CR65","unstructured":"Simonnard, M.: Linear Programming. Englewood Cliffs, N.J., 1966."},{"issue":"4","key":"BF01920269_CR66","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1145\/321724.321734","volume":"19","author":"V. Srinivasan","year":"1972","unstructured":"Srinivasan, V., andG.L. Thompson: Accelerated Algorithms for Labeling and Relabeling of Trees with Applications to Distribution Problems. J. ACM19 (4), 1972, 712\u2013726.","journal-title":"J. ACM"},{"issue":"2","key":"BF01920269_CR67","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1145\/321752.321754","volume":"20","author":"V. Srinivasan","year":"1973","unstructured":"\u2014: Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm. J. ACM20 (2), 1973, 194\u2013213.","journal-title":"J. ACM"},{"key":"BF01920269_CR68","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1002\/nav.3800180206","volume":"18","author":"W. Szwarc","year":"1971","unstructured":"Szwarc, W.: The Transportation Paradox. NRLQ18, 1971, 185\u2013202.","journal-title":"NRLQ"},{"key":"BF01920269_CR69","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/nav.3800200206","volume":"20","author":"H. Wagner","year":"1973","unstructured":"Wagner, H.: The Lower Bounded and Partial Upper Bounded Distribution Problem. NRLQ20, 1973, 265\u2013268.","journal-title":"NRLQ"},{"key":"BF01920269_CR70","doi-asserted-by":"crossref","unstructured":"Zimmermann, U.: Duality principles and the algebraic transportation problem. Numerische Methoden bei graphentheoretischen und kombinatorischen Problemen. Bd. 2. Ed. by L. Collatz, G. Meinardus and W. Wetterling. Basel 1979.","DOI":"10.1007\/978-3-0348-5997-4_16"}],"container-title":["Zeitschrift f\u00fcr Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01920269.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01920269\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01920269","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T09:31:35Z","timestamp":1586338295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01920269"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,2]]},"references-count":70,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1980,2]]}},"alternative-id":["BF01920269"],"URL":"https:\/\/doi.org\/10.1007\/bf01920269","relation":{},"ISSN":["0340-9422","1432-5217"],"issn-type":[{"value":"0340-9422","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1980,2]]}}}