{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T12:04:34Z","timestamp":1764331474728},"reference-count":39,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1980,5,1]],"date-time":"1980-05-01T00:00:00Z","timestamp":325987200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":12130,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1980,5]]},"DOI":"10.1016\/0304-3975(80)90031-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"1-18","source":"Crossref","is-referenced-by-count":36,"title":["The complexity of linear programming"],"prefix":"10.1016","volume":"11","author":[{"given":"David P.","family":"Dobkin","sequence":"first","affiliation":[]},{"given":"Steven P.","family":"Reiss","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(80)90031-6_BIB1","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1137\/0109008","article-title":"An algorithm for finding all vertices of convex polyhedral sets","volume":"9","author":"Balinsky","year":"1961","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0304-3975(80)90031-6_BIB2","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1137\/0126045","article-title":"Generating all the faces of a polyhedron","volume":"26","author":"Burdet","year":"1974","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0304-3975(80)90031-6_BIB3","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1145\/321556.321564","article-title":"An algorithm for convex polytopes","volume":"17","author":"Chand","year":"1970","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(80)90031-6_BIB4","series-title":"Linear Programming and Extensions","author":"Dantzig","year":"1963"},{"issue":"2","key":"10.1016\/0304-3975(80)90031-6_BIB5","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1137\/0205015","article-title":"Multidimensional search problems","volume":"5","author":"Dobkin","year":"1976","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/0304-3975(80)90031-6_BIB6","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/0022-0000(78)90026-0","article-title":"A lower bound of 12n2 on linear search tree programs for the knapsack problem","volume":"16","author":"Dobkin","year":"1978","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"10.1016\/0304-3975(80)90031-6_BIB7","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0020-0190(79)90152-2","article-title":"Linear programming is P-complete","volume":"8","author":"Dobkin","year":"1978","journal-title":"Information Processing Lett."},{"key":"10.1016\/0304-3975(80)90031-6_BIB8","series-title":"Pattern Classification and Scene Analysis","author":"Duda","year":"1973"},{"key":"10.1016\/0304-3975(80)90031-6_BIB9","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","article-title":"Theoretical efficiency in algorithmic efficiency for network flow problems","volume":"19","author":"Edmonds","year":"1972","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(80)90031-6_BIB10","doi-asserted-by":"crossref","first-page":"12","DOI":"10.4153\/CJM-1964-002-x","article-title":"On the number of faces of convex polytope","volume":"16","author":"Gale","year":"1964","journal-title":"Canadian J. Math."},{"issue":"3","key":"10.1016\/0304-3975(80)90031-6_BIB11","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(80)90031-6_BIB12","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","article-title":"An efficient algorithm for determining the convex hull of a finite planar set","volume":"1","author":"Graham","year":"1972","journal-title":"Information Processing Lett."},{"key":"10.1016\/0304-3975(80)90031-6_BIB13","series-title":"Convex Polytopes","author":"Grunbaum","year":"1967"},{"key":"10.1016\/0304-3975(80)90031-6_BIB14","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1090\/S0002-9904-1970-12601-5","article-title":"Polytopes, graphs, and complexes","volume":"76","author":"Grunbaum","year":"1970","journal-title":"Bull. AMS"},{"key":"10.1016\/0304-3975(80)90031-6_BIB15","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0020-0190(73)90020-3","article-title":"On the identification of the convex hull of a finite set of points in the plane","volume":"2","author":"Jarvis","year":"1973","journal-title":"Information Processing Lett."},{"key":"10.1016\/0304-3975(80)90031-6_BIB16","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0304-3975(78)90006-3","article-title":"The densest hemisphere problem","volume":"6","author":"Johnson","year":"1978","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(80)90031-6_BIB17","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(76)90068-2","article-title":"Complete problems for deterministic polynomial time","volume":"3","author":"Jones","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(80)90031-6_BIB18","series-title":"Complexity of Computer Computations","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0304-3975(80)90031-6_BIB19","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/BF01436525","article-title":"A class of linear programming problems requiring a large number of iterations","volume":"7","author":"Klee","year":"1965","journal-title":"Numer. Math."},{"key":"10.1016\/0304-3975(80)90031-6_BIB20","article-title":"Convex polyhedra and mathematical programming","author":"Klee","year":"1974","journal-title":"University of Washington Tech. Report # 50"},{"key":"10.1016\/0304-3975(80)90031-6_BIB21","series-title":"Proc. IBM Scientific Computing Symposium on Combinatorial Problems","first-page":"123","article-title":"Convex polytopes and linear programming","author":"Klee","year":"1966"},{"key":"10.1016\/0304-3975(80)90031-6_BIB22","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/0022-247X(65)90077-6","article-title":"Heights of convex polytopes","volume":"11","author":"Klee","year":"1965","journal-title":"Math. Anal. Appl."},{"key":"10.1016\/0304-3975(80)90031-6_BIB23","doi-asserted-by":"crossref","first-page":"701","DOI":"10.4153\/CJM-1964-067-6","article-title":"On the number of vertices of a convex polytope","volume":"16","author":"Klee","year":"1964","journal-title":"Canadian J. Math."},{"key":"10.1016\/0304-3975(80)90031-6_BIB24","first-page":"159","article-title":"How good is the simplex algorithm","volume":"Vol. III","author":"Klee","year":"1972"},{"key":"10.1016\/0304-3975(80)90031-6_BIB25","article-title":"Linear inequalities and related systems","volume":"38","author":"Kuhn","year":"1956"},{"key":"10.1016\/0304-3975(80)90031-6_BIB26","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1145\/321864.321877","article-title":"On the structure of polynomial time reducibility","volume":"22","author":"Ladner","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(80)90031-6_BIB27","unstructured":"T.M. Liebling, On the number of iterations of the simplex method, Institut fur Operations Research der ETHZ."},{"key":"10.1016\/0304-3975(80)90031-6_BIB28","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1287\/opre.21.1.247","article-title":"An algorithm for determining irrelevant constraints and all vertices in systems of linear inequalities","volume":"21","author":"Mattheis","year":"1973","journal-title":"Operations Research"},{"key":"10.1016\/0304-3975(80)90031-6_BIB29","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0202023","article-title":"An algorithm for the extreme rays of a pointed convex polyhedral cone","volume":"2","author":"McRae","year":"1973","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/0304-3975(80)90031-6_BIB30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(79)90079-6","article-title":"Efficient search for rationals","volume":"8","author":"Papadimitriou","year":"1978","journal-title":"Information Processing Lett."},{"issue":"2","key":"10.1016\/0304-3975(80)90031-6_BIB31","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/359423.359430","article-title":"Convex hulls of finite sets of points in two and three dimensions","volume":"20","author":"Preparata","year":"1977","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(80)90031-6_BIB32","article-title":"Finding the intersection of n half-spaces in time O(n log n)","author":"Preparata","year":"1977","journal-title":"Univ. of Illinois Report"},{"issue":"2","key":"10.1016\/0304-3975(80)90031-6_BIB33","first-page":"87","article-title":"Rational search","volume":"8","author":"Reiss","year":"1978","journal-title":"Information Processing Letters"},{"key":"10.1016\/0304-3975(80)90031-6_BIB34","first-page":"151","article-title":"Closest-point problems","author":"Shamos","year":"1975","journal-title":"Proc. 16th Annual Symposium on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(80)90031-6_BIB35","series-title":"Ph.D. Thesis","article-title":"Computational geometry","author":"Shamos","year":"1978"},{"key":"10.1016\/0304-3975(80)90031-6_BIB36","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/800116.803772","article-title":"Geometric complexity","author":"Shamos","year":"1975","journal-title":"Proc. Seventh Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(80)90031-6_BIB37","series-title":"Convexity and Optimization in Finite Dimensions","author":"Stoer","year":"1970"},{"key":"10.1016\/0304-3975(80)90031-6_BIB38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.6028\/jres.071B.001","article-title":"Algorithms for frames and linearity spaces of cones","volume":"71","author":"Wets","year":"1967","journal-title":"J. Res. Nat. Bur. Standards Sect. B"},{"key":"10.1016\/0304-3975(80)90031-6_BIB39","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01580132","article-title":"A bad network problem for the simplex method and other minimum cost flow algorithms","volume":"5","author":"Zadeh","year":"1973","journal-title":"Math. Programming"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397580900316?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397580900316?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:24:35Z","timestamp":1555111475000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397580900316"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,5]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1980,5]]}},"alternative-id":["0304397580900316"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(80)90031-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1980,5]]}}}