{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T18:13:44Z","timestamp":1649182424304},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1993,3]]},"DOI":"10.1007\/bf02096260","type":"journal-article","created":{"date-parts":[[2005,9,12]],"date-time":"2005-09-12T18:23:22Z","timestamp":1126549402000},"page":"139-156","source":"Crossref","is-referenced-by-count":0,"title":["Combinatoric classes of the transportation problem and their properties"],"prefix":"10.1007","volume":"46-47","author":[{"given":"Ming S.","family":"Hung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walter O.","family":"Rom","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Allan D.","family":"Waren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02096260_CR1","first-page":"29","volume":"31","author":"J.H. Ahrens","year":"1978","unstructured":"J.H. Ahrens, Counting basic feasible solutions of transportation problems, Oper. Res. Verfahren 31 (1978) 29\u201343.","journal-title":"Oper. Res. Verfahren"},{"key":"BF02096260_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, The Hirsch conjecture for dual transportation polyhedra, Math. Oper. Res. 9 (1984) 629\u2013633.","journal-title":"Math. Oper. Res."},{"key":"BF02096260_CR3","first-page":"1","volume":"22","author":"M.L. Balinski","year":"1984","unstructured":"M.L. Balinski and A. Russakoff, Faces of dual transportation polyhedra, Math. Progr. 22 (1984) 1\u20138.","journal-title":"Math. Progr."},{"key":"BF02096260_CR4","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1287\/moor.2.2.103","volume":"2","author":"R.G. Bland","year":"1977","unstructured":"R.G. Bland, New finite pivoting rules for the simplex method, Math. Oper. Res. 2 (1977) 103\u2013107.","journal-title":"Math. Oper. Res."},{"key":"BF02096260_CR5","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0095-8956(72)90060-3","volume":"13","author":"E.D. Bolker","year":"1972","unstructured":"E.D. Bolker, Transportation polytopes, J. Combin. Theory (B) 13 (1972) 251\u2013262.","journal-title":"J. Combin. Theory (B)"},{"key":"BF02096260_CR6","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0167-6377(82)90006-2","volume":"1","author":"R. Chandrasakaran","year":"1982","unstructured":"R. Chandrasakaran, S.N. Kabadie and K.G. Murty, Some NP-complete problems in linear programming, Oper. Res. Lett. 1 (1982) 101\u2013104.","journal-title":"Oper. Res. Lett."},{"key":"BF02096260_CR7","doi-asserted-by":"crossref","first-page":"160","DOI":"10.2307\/1907845","volume":"20","author":"A. Charnes","year":"1952","unstructured":"A. Charnes, Optimality and degeneracy in linear programming, Econometrica 20 (1952) 160\u2013170.","journal-title":"Econometrica"},{"key":"BF02096260_CR8","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01580379","volume":"11","author":"W.H. Cunningham","year":"1976","unstructured":"W.H. Cunningham, A network simplex method, Math. progr. 11 (1976) 105\u2013116.","journal-title":"Math. progr."},{"key":"BF02096260_CR9","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1287\/moor.4.2.196","volume":"4","author":"W.H. Cunningham","year":"1979","unstructured":"W.H. Cunningham, Theoretical properties of the network simplex method, Math. Oper. Res. 4 (1979) 196\u2013208.","journal-title":"Math. Oper. Res."},{"key":"BF02096260_CR10","volume-title":"Linear Programming and Extensions","author":"G.B. Dantzig","year":"1963","unstructured":"G.B. Dantzig,Linear Programming and Extensions (Princeton University Press, NJ, 1963)."},{"key":"BF02096260_CR11","doi-asserted-by":"crossref","first-page":"183","DOI":"10.2140\/pjm.1955.5.183","volume":"5","author":"G.B. Dantzig","year":"1955","unstructured":"G.B. Dantzig, A. Orden and P. Wolfe, The generalized simplex method for minimizing a linear form under linear inequality restraints, Pacific J. Math. 5 (1955) 183\u2013195.","journal-title":"Pacific J. Math."},{"key":"BF02096260_CR12","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(86)90084-3","volume":"13","author":"M.S. Hung","year":"1986","unstructured":"M.S. Hung, W.O. Rom and A.D. Waren, Degeneracy in transportation problems, Discr. Appl. Math. 13 (1986) 223\u2013237.","journal-title":"Discr. Appl. Math."},{"key":"BF02096260_CR13","series-title":"Lectures in Applied Mathematics","first-page":"257","volume-title":"Mathematics of the Decision Sciences, Part I","author":"V. Klee","year":"1968","unstructured":"V. Klee and C. Witzgall, Facets and vertices of transportation polytopes, in:Mathematics of the Decision Sciences, Part I, Lectures in Applied Mathematics, Vol. 11 (American Mathematical Society, Providence, RI, 1968) pp. 257\u2013282."},{"key":"BF02096260_CR14","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0024-3795(91)90165-S","volume":"150","author":"R. Loewy","year":"1991","unstructured":"R. Loewy, D.R. Shier and C.R. Johnson, Perron eigenvectors and the symmetric transportation polytope, Lin. Alg. Appl. 150 (1991) 139\u2013155.","journal-title":"Lin. Alg. Appl."},{"key":"BF02096260_CR15","volume-title":"Linear Programming","author":"K.G. Murty","year":"1983","unstructured":"K.G. Murty,Linear Programming (Wiley, New York, 1983)."},{"key":"BF02096260_CR16","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01753437","volume":"1","author":"L.S. Shapley","year":"1972","unstructured":"L.S. Shapley and M. Shubik, The assignment game I: The core, Int. J. Game Theory 1 (1972) 111\u2013130.","journal-title":"Int. J. Game Theory"},{"key":"BF02096260_CR17","doi-asserted-by":"crossref","unstructured":"G.L. Thompson, Computing the core of a market game, in:Extremal Methods and Systems Analysis, eds. A.V. Fiacco and K.O. Kortanek (Springer, 1980) pp. 312\u2013334.","DOI":"10.1007\/978-3-642-46414-0_15"},{"key":"BF02096260_CR18","unstructured":"G.L. Thompson, Auction and market games, in:Essays in Game Theory and Mathematical Economics in Honor of Oskar Morgenstern, eds. R.J. Aumann et al. (Bibliographisches Institut Mannheim, 1981) pp. 181\u2013196."},{"key":"BF02096260_CR19","unstructured":"V.A. Yemelichev, M.M. Kovalev and M.K. Kravtsov,Polytopes, Graphs and Optimization (Cambridge University Press, 1984)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02096260.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02096260\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02096260","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T00:39:02Z","timestamp":1557794342000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02096260"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["BF02096260"],"URL":"https:\/\/doi.org\/10.1007\/bf02096260","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}