{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T12:04:21Z","timestamp":1774526661546,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1991,7,1]],"date-time":"1991-07-01T00:00:00Z","timestamp":678326400000},"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":[[1991,7]]},"DOI":"10.1007\/bf01586925","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T12:19:31Z","timestamp":1114690771000},"page":"45-54","source":"Crossref","is-referenced-by-count":39,"title":["An infeasible (exterior point) simplex algorithm for assignment problems"],"prefix":"10.1007","volume":"51","author":[{"given":"Konstantinos","family":"Paparrizos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1287\/moor.9.4.629","volume":"9","author":"M.L. Balinski","year":"1984","unstructured":"M.L. Balinski, \u201cThe Hirsch conjecture for dual transportation polyhedra,\u201dMathematics of Operations Research 9 (1984) 629\u2013633.","journal-title":"Mathematics of Operations Research"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1287\/opre.33.3.527","volume":"33","author":"M.L. Balinski","year":"1985","unstructured":"M.L. Balinski, \u201cSignature methods for the assignment problem,\u201dOperations Research 33 (1985) 527\u2013536.","journal-title":"Operations Research"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01580579","volume":"34","author":"M.L. Balinski","year":"1986","unstructured":"M.L. Balinski, \u201cA competitive (dual) simplex method for the assignment problem,\u201dMathematical Programming 34 (1986) 125\u2013141.","journal-title":"Mathematical Programming"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01584319","volume":"13","author":"R. Barr","year":"1977","unstructured":"R. Barr, F. Glover and D. Klingman, \u201cThe alternating path basis algorithm for the assignment problem,\u201dMathematical Programming 13 (1977) 1\u201313.","journal-title":"Mathematical Programming"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01580379","volume":"11","author":"W.H. Cunningham","year":"1976","unstructured":"W.H. Cunningham, \u201cA network simplex method,\u201dMathematical Programming 11 (1976) 105\u2013116.","journal-title":"Mathematical Programming"},{"key":"CR6","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":"CR7","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1090\/S0002-9904-1964-11167-8","volume":"70","author":"G.B. Dantzig","year":"1964","unstructured":"G.B. Dantzig, \u201cEight unsolved problems from mathematical programming,\u201dBulletin of the American Mathematical Society 70 (1964) 499\u2013500.","journal-title":"Bulletin of the American Mathematical Society"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1287\/opre.6.3.419","volume":"6","author":"L.R. Ford","year":"1958","unstructured":"L.R. Ford and D.R. Fulkerson, \u201cConstructing maximal dynamic flows from static flows,\u201dOperations Research 6 (1958) 419\u2013433.","journal-title":"Operations Research"},{"key":"CR9","volume-title":"Flows in Networks","author":"L.R. Ford","year":"1962","unstructured":"L.R. Ford and D.R. Fulkerson,Flows in Networks (Princeton University Press, Princeton, NJ, 1962)."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"M.L. Fredman and R.E. Tarjan, \u201cFibonacci heaps and their uses in network optimization algorithms,\u201d25th IEEE Symposium on Foundations of Computer Science (1984) 338\u2013346.","DOI":"10.1109\/SFCS.1984.715934"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1287\/opre.28.4.969","volume":"28","author":"M.S. Hung","year":"1980","unstructured":"M.S. Hung and W.O. Rom, \u201cSolving the assignment problem by relaxation,\u201dOperations Research 28 (1980) 969\u2013982.","journal-title":"Operations Research"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF02591692","volume":"37","author":"P. Kleinschmidt","year":"1987","unstructured":"P. Kleinschmidt, C.W. Lee and H. Schannath, \u201cTransportation problems which can be solved by the use of Hirsch-paths for the dual problems,\u201dMathematical Programming 37 (1987) 153\u2013168.","journal-title":"Mathematical Programming"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1051\/ro\/1988220302691","volume":"22","author":"K. Paparrizos","year":"1988","unstructured":"K. Paparrizos, \u201cA non-dual signature method for the assignment problem and a generalization of the dual simplex method for the transportation problem,\u201dRAIRO Operations Research 22 (1988) 269\u2013289.","journal-title":"RAIRO Operations Research"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1287\/moor.10.3.439","volume":"10","author":"P.M. White","year":"1985","unstructured":"P.M. White, A.S. Caplin and L. Van der Heyden, \u201cScarf's procedure for integer programming and a dual simplex algorithm,\u201dMathematics of Operations Reseach 10 (1985) 439\u2013449.","journal-title":"Mathematics of Operations Reseach"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01586925.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01586925\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01586925","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:31:34Z","timestamp":1556897494000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01586925"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,7]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1991,7]]}},"alternative-id":["BF01586925"],"URL":"https:\/\/doi.org\/10.1007\/bf01586925","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,7]]}}}