{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T00:54:59Z","timestamp":1768784099549,"version":"3.49.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,12,8]],"date-time":"2016-12-08T00:00:00Z","timestamp":1481155200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s10479-016-2385-z","type":"journal-article","created":{"date-parts":[[2016,12,7]],"date-time":"2016-12-07T18:21:44Z","timestamp":1481134904000},"page":"47-65","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Combinatorial redundancy detection"],"prefix":"10.1007","volume":"265","author":[{"given":"Komei","family":"Fukuda","sequence":"first","affiliation":[]},{"given":"Bernd","family":"G\u00e4rtner","sequence":"additional","affiliation":[]},{"given":"May","family":"Szedl\u00e1k","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,8]]},"reference":[{"key":"2385_CR1","volume-title":"Oriented matroids","author":"A Bj\u00f6rner","year":"1993","unstructured":"Bj\u00f6rner, A., Las Vergnas, M., Sturmfels, B., White, N., & Ziegler, G. (1993). Oriented matroids. Cambridge: Cambridge University Press."},{"issue":"4","key":"2385_CR2","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF02712874","volume":"16","author":"TM Chan","year":"1996","unstructured":"Chan, T. M. (1996). Output-sensitive results on convex hulls, extreme points, and related problems. Discrete and Computational Geometry, 16(4), 369\u2013387.","journal-title":"Discrete and Computational Geometry"},{"key":"2385_CR3","volume-title":"Linear programming","author":"V Chvatal","year":"1980","unstructured":"Chvatal, V. (1980). Linear programming. London: W.H. Freeman and Company."},{"key":"2385_CR4","doi-asserted-by":"crossref","unstructured":"Clarkson, K.\u00a0L. (1994). More output-sensitive geometric algorithms. In Proceedings 35th Annual IEEE Symposium on Foundations of Computer Science, pp. 695\u2013702.","DOI":"10.1109\/SFCS.1994.365723"},{"key":"2385_CR5","doi-asserted-by":"crossref","DOI":"10.1515\/9781400884179","volume-title":"Linear programming and extensions","author":"GB Dantzig","year":"1963","unstructured":"Dantzig, G. B. (1963). Linear programming and extensions. Princeton, NJ: Princeton University Press."},{"issue":"3","key":"2385_CR6","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1287\/ijoc.10.3.323","volume":"10","author":"JH Dul\u00e1","year":"1998","unstructured":"Dul\u00e1, J. H., Helgason, R. V., & Venugopal, N. (1998). An algorithm for identifying the frame of a pointed finite conical hull. INFORMS Journal on Computing, 10(3), 323\u2013330.","journal-title":"INFORMS Journal on Computing"},{"key":"2385_CR7","unstructured":"Fukuda, K. (2011a). Introduction to optimization. \n                        https:\/\/www.inf.ethz.ch\/personal\/fukudak\/lect\/opt2011\/aopt11note1.pdf\n                        \n                    ."},{"key":"2385_CR8","unstructured":"Fukuda, K. (2011b). Walking on the arrangement, not on the feasible region. \n                        http:\/\/helper.ipam.ucla.edu\/publications\/sm2011\/sm2011_9630.pdf\n                        \n                    ."},{"key":"2385_CR9","unstructured":"Fukuda, K. (2016). Lecture: polyhedral computation. \n                        http:\/\/www-oldurls.inf.ethz.ch\/personal\/fukudak\/lect\/pclect\/notes2016\/\n                        \n                    ."},{"key":"2385_CR10","first-page":"315","volume-title":"31st international symposium on computational geometry (SoCG 2015). Leibniz international proceedings in informatics (LIPIcs)","author":"K Fukuda","year":"2015","unstructured":"Fukuda, K., G\u00e4rtner, B., & Szedl\u00e1k, M. (2015). Combinatorial redundancy detection. In L. Arge & J. Pach (Eds.), 31st international symposium on computational geometry (SoCG 2015). Leibniz international proceedings in informatics (LIPIcs) (Vol. 34, pp. 315\u2013328). Dagstuhl: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"2385_CR11","doi-asserted-by":"crossref","first-page":"45","DOI":"10.15807\/jorsj.35.45","volume":"35","author":"K Fukuda","year":"1992","unstructured":"Fukuda, K., & Terlaky, T. (1992). Linear complementarity and oriented matroids. Journal of the Operations Research Society of Japan, 35, 45\u201361.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"2385_CR12","first-page":"369","volume":"79","author":"K Fukuda","year":"1997","unstructured":"Fukuda, K., & Terlaky, T. (1997). Criss-cross methods: A fresh view on pivot algorithms. Mathematical Programming, 79, 369\u2013395.","journal-title":"Mathematical Programming"},{"key":"2385_CR13","first-page":"159","volume-title":"Inequalities III","author":"V Klee","year":"1972","unstructured":"Klee, V., & Minty, G. J. (1972). How good is the simplex algorithm? In O. Shisha (Ed.), Inequalities III (pp. 159\u2013175). Cambridge: Academic Press."},{"key":"2385_CR14","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1007\/BF01940877","volume":"16","author":"J Matou\u0161ek","year":"1996","unstructured":"Matou\u0161ek, J., Sharir, M., & Welzl, E. (1996). A subexponential bound for linear programming. Algorithmica, 16, 498\u2013516.","journal-title":"Algorithmica"},{"key":"2385_CR15","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1112\/S0025579300002850","volume":"17","author":"P McMullen","year":"1970","unstructured":"McMullen, P. (1970). The maximum numbers of faces of a convex polytope. Mathematika, 17, 179\u2013184.","journal-title":"Mathematika"},{"key":"2385_CR16","doi-asserted-by":"crossref","unstructured":"Ottmann, Th., Schuierer, S., & Soundaralakshmi, S. (1995). Enumerating extreme points in higher dimensions. In E. W. Mayer & C. Puech (Eds.), STACS 95: 12th annual symposium on theoretical aspects of computer science. Lecture notes in computer science (Vol. 900, pp. 562\u2013570). Berlin: Springer.","DOI":"10.1007\/3-540-59042-0_105"},{"key":"2385_CR17","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01585729","volume":"46","author":"C Roos","year":"1990","unstructured":"Roos, C. (1990). An exponential example for Terlaky\u2019s pivoting rule for the criss-cross simplex method. Mathematical Programming, 46, 79\u201384.","journal-title":"Mathematical Programming"},{"key":"2385_CR18","volume-title":"Theory of linear and integer programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A. (1986). Theory of linear and integer programming. New York: Wiley."},{"key":"2385_CR19","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0095-8956(87)90049-9","volume":"42","author":"T Terlaky","year":"1987","unstructured":"Terlaky, T. (1987). A finite criss-cross method for the oriented matroids. Journal of Combinatorial Theory Series B, 42, 319\u2013327.","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"2385_CR20","first-page":"120","volume":"8B","author":"Z Wang","year":"1987","unstructured":"Wang, Z. (1987). A finite conformal-elimination free algorithm over oriented matroid programming. Chinese Annals of Mathematics, 8B, 120\u2013125.","journal-title":"Chinese Annals of Mathematics"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-016-2385-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2385-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2385-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,4,19]],"date-time":"2018-04-19T10:35:38Z","timestamp":1524134138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-016-2385-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,8]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["2385"],"URL":"https:\/\/doi.org\/10.1007\/s10479-016-2385-z","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,8]]}}}