{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T20:03:15Z","timestamp":1772740995555,"version":"3.50.1"},"reference-count":17,"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\/bf01584319","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:28:00Z","timestamp":1114676880000},"page":"1-13","source":"Crossref","is-referenced-by-count":108,"title":["The alternating basis algorithm for assignment problems"],"prefix":"10.1007","volume":"13","author":[{"given":"R. S.","family":"Barr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Glover","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Klingman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"R.S. Barr, \u201cStreamlining primal simplex transportation codes\u201d, Research Rep., Center for Cybernetic Studies, University of Texas, Austin, TX, to appear."},{"key":"CR2","unstructured":"R.S. Barr, F. Glover and D. Klingman, \u201cEnhancements to spanning tree labeling procedures for network optimization\u201d, Rep. 262, Center for Cybernetic Studies, University of Texas, Austin, TX."},{"issue":"1","key":"CR3","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/BF01585504","volume":"7","author":"R.S. Barr","year":"1974","unstructured":"R.S. Barr, F. Glover and D. Klingman, \u201cAn improved version of the out-of-kilter method and a comparative study of computer codes\u201d,Mathematical Programming 7 (1) (1974) 60\u201387.","journal-title":"Mathematical Programming"},{"key":"CR4","unstructured":"G. Bradley, G. Brown and G. Graves, \u201cA comparison of storage structure for primal network codes\u201d, presented at ORSA\/TIMS conference, Chicago, April 1975."},{"key":"CR5","unstructured":"G. Bradley, G. Brown and G. Graves, \u201cTailoring primal network codes to classes of problems with common structure\u201d, ORSA\/TIMS conference, Las Vegas (1975)."},{"key":"CR6","unstructured":"W.H. Cunningham, \u201cA network simplex method\u201d, Tech. Rep. No. 207, Dept. of Mathematical Sciences, Johns Hopkins University (1974)."},{"key":"CR7","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\u2013226.","journal-title":"Transportation Science"},{"issue":"3","key":"CR8","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1002\/net.3230040302","volume":"4","author":"F. Glover","year":"1974","unstructured":"F. Glover, D. Karney and D. Klingman, \u201cImplementation and computational study on start procedures and basis change criteria for a primal network code\u201d,Networks 4 (3) (1974) 191\u2013212.","journal-title":"Networks"},{"issue":"1","key":"CR9","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1287\/trsc.6.2.171","volume":"6","author":"F. Glover","year":"1972","unstructured":"F. Glover, D. Karney and D. Klingman, \u201cAugmented predecessor index method for location stepping stone paths and assigning dual prices in distribution problems\u201d,Transportation Science 6 (1) (1972) 171\u2013181.","journal-title":"Transportation Science"},{"issue":"5","key":"CR10","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 computational study on start procedures, basis change criteria, and solution algorithms for transportation problems\u201d,Management Science 20 (5) (1974) 793\u2013819.","journal-title":"Management Science"},{"key":"CR11","volume-title":"\u201cImproved labeling of L.P. bases in networks\u201d, Research Report CS 218","author":"F. Glover","year":"1974","unstructured":"F. Glover and D. Klingman, \u201cImproved labeling of L.P. bases in networks\u201d, Research Report CS 218, Center for Cybernetic Studies, University of Texas, Austin, TX (1974)."},{"issue":"3","key":"CR12","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1080\/03155986.1974.11731583","volume":"12","author":"F. Glover","year":"1974","unstructured":"F. Glover, D. Klingman and J. Stutz, \u201cAugmented threaded method\u201d,Canadian Journal of Operational Research and Information Processing 12 (3) (1974) 293\u2013298.","journal-title":"Canadian Journal of Operational Research and Information Processing"},{"key":"CR13","unstructured":"R.S. Hatch, \u201cOptimization strategies for large scale assignment and transportation type problems\u201d, ORSA\/TIMS conference, San Juan, Puerto Rico (1974)."},{"issue":"5","key":"CR14","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1287\/mnsc.20.5.814","volume":"20","author":"D. Klingman","year":"1974","unstructured":"D. Klingman, A. Napier and J. Stutz, \u201cNETGEN-A program for generating large scale (un)capacitated assignment, transportation, and minimum cost flow network problems\u201d,Management Science 20 (5) (1974) 814\u2013822.","journal-title":"Management Science"},{"key":"CR15","unstructured":"J. Mulvey, \u201cColumn weighting factors and other enhancements to the augmented threaded index method for network optimization\u201d, Joint ORSA\/TIMS conference, San Juan, Puerto Rico (1974)."},{"key":"CR16","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 Association of Computing Machines 20 (1973) 194\u2013213.","journal-title":"Journal of the Association of Computing Machines"},{"issue":"4","key":"CR17","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1145\/321724.321734","volume":"19","author":"V. Srinivasan","year":"1972","unstructured":"V. Srinivasan and G.L. Thompson, \u201cAccelerated algorithms for labeling and relabeling of trees with application for distribution problems\u201d,Journal of the Association of Computing Machines 19 (4) (1972) 712\u2013726.","journal-title":"Journal of the Association of Computing Machines"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01584319.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01584319\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01584319","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:29:30Z","timestamp":1556897370000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01584319"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,12]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1977,12]]}},"alternative-id":["BF01584319"],"URL":"https:\/\/doi.org\/10.1007\/bf01584319","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1977,12]]}}}