{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T17:21:43Z","timestamp":1697908903741},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1977,12,1]],"date-time":"1977-12-01T00:00:00Z","timestamp":249782400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1977,12]]},"DOI":"10.1007\/bf01593789","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T20:13:01Z","timestamp":1114719181000},"page":"226-240","source":"Crossref","is-referenced-by-count":13,"title":["The zero pivot phenomenon in transportation and assignment problems and its computational implications"],"prefix":"10.1007","volume":"12","author":[{"given":"B.","family":"Gavish","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Schweitzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Shlifer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BFb0121240","volume":"1","author":"M.L. Balinski","year":"1974","unstructured":"M.L. Balinski, \u201cOn two special classes of transportation polytopes\u201d,Mathematical Programming Study 1 (1974) 43\u201358.","journal-title":"Mathematical Programming Study"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/opre.16.3.538","volume":"16","author":"M. Bellmore","year":"1968","unstructured":"M. Bellmore and G. Nemhauser, \u201cThe travelling salesman problem: a survey\u201d,Operations Research 16 (1968) 538\u2013550.","journal-title":"Operations Research"},{"key":"CR3","volume-title":"The optimum solution to a school bus scheduling problem","author":"R. Bushnell","year":"1973","unstructured":"Bushnell, R. and G. Venkatramn, \u201cThe optimum solution to a school bus scheduling problem\u201d, Wayne State University, Detroit, MI, (1973)."},{"key":"CR4","volume-title":"\u201cPast, present and future of development, computational efficiency and practical use of large scale transportation and transhipment computer codes\u201d, Research Rep. CS 131","author":"A. Charnes","year":"1973","unstructured":"A. Charnes, F. Glover, D. Karney, D. Klingman and J. Stutz, \u201cPast, present and future of development, computational efficiency and practical use of large scale transportation and transhipment computer codes\u201d, Research Rep. CS 131, Center for Cybernetic Studies, University of Texas, Austin (1973)."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"L. Cooper, \u201cThe transportation-location problem\u201d,Operations Research (1972) 94\u2013108.","DOI":"10.1287\/opre.20.1.94"},{"key":"CR6","unstructured":"R.D. Davis, \u201cOn the delivery problem and some related topics\u201d, Doctoral dissertation, Northwestern University (1968)."},{"key":"CR7","volume-title":"Linear programming and extensions","author":"G.B. Dantzig","year":"1963","unstructured":"G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, NJ 1963)."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"E.W. Dijkstra, \u201cA note on two problems in connection with graphs\u201d,Numerische Mathematik 1 (1959) 269\u2013271.","journal-title":"Numerische Mathematik"},{"key":"CR9","first-page":"101","volume":"8","author":"M. Florian","year":"1970","unstructured":"M. Florian and M. Klein, \u201cAn experimental evaluation of some methods of solving the assignment problem\u201d,Canadian Operating Research 8 (1970) 101\u2013106.","journal-title":"Canadian Operating Research"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1287\/trsc.8.1.13","volume":"8","author":"B. Gavish","year":"1974","unstructured":"B. Gavish and P. Schweitzer, \u201cAn algorithm for combining truck trips\u201d,Transportation Science 8 (1974) 13\u201323.","journal-title":"Transportation Science"},{"key":"CR11","volume-title":"\u201cMulticommodity distribution system design by benders decomposition\u201d, Working Paper No. 109","author":"A. Geoffrion","year":"1973","unstructured":"A. Geoffrion and G. Graves, \u201cMulticommodity distribution system design by benders decomposition\u201d, Working Paper No. 109, Western Management Science Institute, University of California, Los Angeles, (1973)."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1287\/trsc.4.2.220","volume":"4","author":"F. Glover","year":"1970","unstructured":"F. Glover and D. Klingman, \u201cLocating stepping-stone paths in distribution problems via the predecessor index method\u201d,Transportation Science 4 (1970) 220\u2013225.","journal-title":"Transportation Science"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1287\/mnsc.20.5.783","volume":"20","author":"F. Glover","year":"1974","unstructured":"F. Glover, D. Karney, D. Klingman and A. Napier, \u201cA computation study on start procedures; basic change criteria and solution algorithms for transportation problems\u201d,Management Science 20 (1974) 793\u2013813.","journal-title":"Management Science"},{"key":"CR14","volume-title":"\u201cThe augmented threaded index method\u201d, Research Rept. CS 144","author":"F. Glover","year":"1973","unstructured":"F. Glover, D. Karney and J. Stutz, \u201cThe augmented threaded index method\u201d, Research Rept. CS 144, Center for Cybernetic Studies, The University of Texas, Austin (1973)."},{"issue":"1","key":"CR15","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/355626.355634","volume":"1","author":"F. Glover","year":"1975","unstructured":"F. Glover and D. Klingman, \u201cReal world applications of network related problems and breakthroughs in solving them efficiently\u201d,ACM Transactions on Mathematical Software 1 (1) (1975) 47\u201355.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"CR16","volume-title":"Optimization strategies for large scale assignment and transportation problems","author":"R.S. Hatch","year":"1974","unstructured":"R.S. Hatch, \u201cOptimization strategies for large scale assignment and transportation problems\u201d, DSA, Rockville, Maryland (1974)."},{"key":"CR17","volume-title":"\u201cImplementation and computational study on an in-core out-of-core primal network code\u201d, Research Rept. CS 158","author":"D. Karney","year":"1973","unstructured":"D. Karney and D. Klingman, \u201cImplementation and computational study on an in-core out-of-core primal network code\u201d, Research Rept. CS 158, Center for Cybernetic Studies, University of Texas, Austin (1973)."},{"key":"CR18","volume-title":"An experimental study of the transportation algorithms","author":"S. Lee","year":"1968","unstructured":"S. Lee, \u201cAn experimental study of the transportation algorithms\u201d, Master's Thesis, Graduate School of Business, University of California, Los Angeles (1968)."},{"key":"CR19","doi-asserted-by":"crossref","unstructured":"K.G. Murty, \u201cSolving the fixed charge transportation problem by ranking the extreme points\u201d,Operations Research (16) (1968) 268\u2013279.","DOI":"10.1287\/opre.16.2.268"},{"issue":"2","key":"CR20","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1145\/321752.321754","volume":"20","author":"V. Srinivasan","year":"1973","unstructured":"V. Srinivasan and G.L. Thompson, \u201cBenefit-cost analysis of coding techniques for the primal transportation algorithm\u201d,Journal of the ACM 20 (2) (1973) 194\u2013213.","journal-title":"Journal of the ACM"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01593789.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01593789\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01593789","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:48:02Z","timestamp":1556898482000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01593789"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,12]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1977,12]]}},"alternative-id":["BF01593789"],"URL":"https:\/\/doi.org\/10.1007\/bf01593789","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1977,12]]}}}