{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T19:56:40Z","timestamp":1726430200208},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1987,6,1]],"date-time":"1987-06-01T00:00:00Z","timestamp":549504000000},"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":[[1987,6]]},"DOI":"10.1007\/bf02591692","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T15:45:41Z","timestamp":1175183141000},"page":"153-168","source":"Crossref","is-referenced-by-count":20,"title":["Transportation problems which can be solved by the use of hirsch-paths for the dual problems"],"prefix":"10.1007","volume":"37","author":[{"given":"Peter","family":"Kleinschmidt","sequence":"first","affiliation":[]},{"given":"Carl W.","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Heinz","family":"Schannath","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02591692_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,\u201dMathematical Programming Study 1 (1974) 43\u201358.","journal-title":"Mathematical Programming Study"},{"key":"BF02591692_CR2","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":"BF02591692_CR3","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":"BF02591692_CR4","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":"BF02591692_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-51576-7","volume-title":"Assignment and Matching Problems: Solution Methods with FORTRAN-Programs","author":"R.E. Burkard","year":"1980","unstructured":"R.E. Burkard and U. Derigs,Assignment and Matching Problems: Solution Methods with FORTRAN-Programs (Springer, Berlin, Heidelberg, New York, 1980)."},{"key":"BF02591692_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, New Jersey, 1963)."},{"key":"BF02591692_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":"BF02591692_CR8","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, New Jersey, 1962)."},{"key":"BF02591692_CR9","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1007\/BF01582245","volume":"33","author":"D. Goldfarb","year":"1985","unstructured":"D. Goldfarb, \u201cEflicient dual simplex algorithms for the assignment problem,\u201dMathematical Programming 33 (1985) 969\u2013982.","journal-title":"Mathematical Programming"},{"key":"BF02591692_CR10","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.D. Rom, \u201cSolving the assignment problem by relaxation,\u201dOperations Research 28 (1980) 969\u2013982.","journal-title":"Operations Research"},{"key":"BF02591692_CR11","doi-asserted-by":"crossref","unstructured":"V.L. Klee and P. Kleinschmidt, \u201cThe d-step conjecture and its relatives,\u201dMathematics of Operations Research to appear.","DOI":"10.1287\/moor.12.4.718"},{"key":"BF02591692_CR12","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF02395040","volume":"133","author":"V.L. Klee","year":"1967","unstructured":"V.L. Klee and D.W. Walkup, \u201cThe d-step conjecture for polyhedra of dimensiond<6,\u201dActa Mathematica 133 (1967) 53\u201378.","journal-title":"Acta Mathematica"},{"key":"BF02591692_CR13","volume-title":"An Introduction to Combinatorial Analysis","author":"J. Riordan","year":"1958","unstructured":"J. Riordan,An Introduction to Combinatorial Analysis (Wiley, New York, 1958)."},{"key":"BF02591692_CR14","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1145\/367436.367471","volume":"3","author":"R. Silver","year":"1960","unstructured":"R. Silver, \u201cAn algorithm for the assignment problem,\u201dCommunications of the Association of Computing Machinery 3 (1960) 603\u2013606.","journal-title":"Communications of the Association of Computing Machinery"},{"key":"BF02591692_CR15","first-page":"179","volume":"1","author":"N. Tomizawa","year":"1972","unstructured":"N. Tomizawa, \u201cOn some techniques useful for solution of transportation network problems,\u201dNetworks 1 (1972) 179\u2013194.","journal-title":"Networks"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591692.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02591692\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591692","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:37:48Z","timestamp":1558395468000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02591692"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,6]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,6]]}},"alternative-id":["BF02591692"],"URL":"https:\/\/doi.org\/10.1007\/bf02591692","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,6]]}}}