{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T12:09:20Z","timestamp":1712318960445},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,6,14]],"date-time":"2018-06-14T00:00:00Z","timestamp":1528934400000},"content-version":"tdm","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":[[2019,3]]},"DOI":"10.1007\/s10479-018-2926-8","type":"journal-article","created":{"date-parts":[[2018,6,14]],"date-time":"2018-06-14T14:42:41Z","timestamp":1528987361000},"page":"531-553","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Total dual integrality of the linear complementarity problem"],"prefix":"10.1007","volume":"274","author":[{"given":"Hanna","family":"Sumita","sequence":"first","affiliation":[]},{"given":"Naonori","family":"Kakimura","sequence":"additional","affiliation":[]},{"given":"Kazuhisa","family":"Makino","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,14]]},"reference":[{"issue":"1","key":"2926_CR1","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0095-8956(92)90005-I","volume":"56","author":"A Bouchet","year":"1992","unstructured":"Bouchet, A. (1992). A characterization of unimodular orientations of simple graphs. Journal of Combinatorial Theory, Series B, 56(1), 45\u201354.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"2926_CR2","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/B978-0-12-566780-7.50011-8","volume":"8","author":"R Chandrasekaran","year":"1984","unstructured":"Chandrasekaran, R. (1984). Integer programming problems for which a simple rounding type algorithm works. Progress in Combinatorial Optimization, 8, 101\u2013106.","journal-title":"Progress in Combinatorial Optimization"},{"issue":"2","key":"2926_CR3","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1287\/moor.23.2.390","volume":"23","author":"R Chandrasekaran","year":"1998","unstructured":"Chandrasekaran, R., Kabadi, S. N., & Sridhar, R. (1998). Integer solution for linear complementarity problem. Mathematics of Operations Research, 23(2), 390\u2013402.","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"2926_CR4","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/BF00940344","volume":"60","author":"SJ Chung","year":"1989","unstructured":"Chung, S. J. (1989). NP-completeness of the linear complementarity problem. Journal of Optimization Theory and Applications, 60(3), 393\u2013399.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"2926_CR5","first-page":"64","volume-title":"A polynomial-time test for total dual integrality in fixed dimension","author":"W Cook","year":"1984","unstructured":"Cook, W., Lov\u00e1sz, L., & Schrijver, A. (1984). A polynomial-time test for total dual integrality in fixed dimension (pp. 64\u201369). Berlin Heidelberg, Berlin, Heidelberg: Springer."},{"key":"2926_CR6","unstructured":"Cottle, R. W. (1968). The principal pivoting method of quadratic programming. In Mathematics of decision sciences, part 1 (pp. 142\u2013162). Providence R.I.: American Mathematical Society."},{"issue":"1","key":"2926_CR7","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0024-3795(68)90052-9","volume":"1","author":"RW Cottle","year":"1968","unstructured":"Cottle, R. W., & Dantzig, G. B. (1968). Complementary pivot theory of mathematical programming. Linear Algebra and its Applications, 1(1), 103\u2013125.","journal-title":"Linear Algebra and its Applications"},{"key":"2926_CR8","volume-title":"The linear complementarity problem","author":"RW Cottle","year":"1992","unstructured":"Cottle, R. W., Pang, J. S., & Stone, R. E. (1992). The linear complementarity problem. Boston: Academic Press."},{"key":"2926_CR9","doi-asserted-by":"crossref","unstructured":"Cottle, R. W., Pang, J. S., & Venkateswaran, V. (1989). Sufficient matrices and the linear complementarity problem. Linear Algebra and its Applications, 114\u2013115, 231\u2013249 (special Issue Dedicated to Alan J. Hoffman).","DOI":"10.1016\/0024-3795(89)90463-1"},{"issue":"1","key":"2926_CR10","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1287\/moor.23.1.61","volume":"23","author":"WH Cunningham","year":"1998","unstructured":"Cunningham, W. H., & Geelen, J. F. (1998). Integral solutions of linear complementarity problems. Mathematics of Operations Research, 23(1), 61\u201368.","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"2926_CR11","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10107-007-0103-y","volume":"114","author":"G Ding","year":"2008","unstructured":"Ding, G., Feng, L., & Zang, W. (2008). The complexity of recognizing linear systems with certain integrality properties. Mathematical Programming, 114(2), 321\u2013334.","journal-title":"Mathematical Programming"},{"key":"2926_CR12","unstructured":"Edmonds, J., & Giles, R. (1977). A min-max relation for submodular functions on graphs. In P. L. Hammer, E. L. Johnson, B. H. Korte & G. L. Nemhauser (Eds.), Studies in integer programming, Annals of discrete mathematics (Vol. 1, pp. 185\u2013204). Amsterdam: Elsevier."},{"issue":"1","key":"2926_CR13","doi-asserted-by":"publisher","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(1), 45\u201361.","journal-title":"Journal of the Operations Research Society of Japan"},{"issue":"5","key":"2926_CR14","doi-asserted-by":"publisher","first-page":"1339","DOI":"10.1016\/j.cor.2012.10.017","volume":"40","author":"SA Gabriel","year":"2013","unstructured":"Gabriel, S. A., Conejo, A. J., Ruiz, C., & Siddiqui, S. (2013). Solving discretely constrained, mixed linear complementarity problems with applications in energy. Computers & Operations Research, 40(5), 1339\u20131350.","journal-title":"Computers & Operations Research"},{"key":"2926_CR15","unstructured":"Garey, M. R., & Johnson, D. S. (1990). Computers and intractability; A guide to the theory of NP-completeness. New York: W. H. Freeman & Co."},{"key":"2926_CR16","doi-asserted-by":"crossref","unstructured":"Harville, D. A. (1997). Matrix algebra from a statistician\u2019s perspective. New York: Springer.","DOI":"10.1007\/b98818"},{"key":"2926_CR17","unstructured":"Hoffman, A. J., & Kruskal, J. B. (1956). Integral boundary points of convex polyhedra. In H. Kuhn & A. Tucker (Eds.), Linear inequalities and related systems (pp. 223\u2013246). Princeton: Princeton University Press."},{"key":"2926_CR18","doi-asserted-by":"crossref","unstructured":"Howson, J. T., Jr. (1972). Equilibria of polymatrix games. Management Science,\n                           18(5-part-1), 312\u2013318","DOI":"10.1287\/mnsc.18.5.312"},{"key":"2926_CR19","unstructured":"Kronecker, L. (1884). N\u00e4herungsweise ganzzahlige aufl\u00f6sung linearer gleichungen. Monatsberichte der K\u00f6niglich Preussischen Akademie der Wissenschaften zu Berlin, 1179\u20131193, 1271\u20131299."},{"issue":"7","key":"2926_CR20","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1287\/mnsc.11.7.681","volume":"11","author":"CE Lemke","year":"1965","unstructured":"Lemke, C. E. (1965). Bimatrix equilibrium points and mathematical programming. Management Science, 11(7), 681\u2013689.","journal-title":"Management Science"},{"key":"2926_CR21","unstructured":"Murty, K. G. (1997). Linear complementarity, linear and nonlinear programming. Internet Edition, \n                    http:\/\/www-personal.umich.edu\/~murty\/books\/linear_complementarity_webbook\/"},{"issue":"1","key":"2926_CR22","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s10107-009-0294-5","volume":"128","author":"J Pap","year":"2011","unstructured":"Pap, J. (2011). Recognizing conic TDI systems is hard. Mathematical Programming, 128(1), 43\u201348.","journal-title":"Mathematical Programming"},{"issue":"3\u20134","key":"2926_CR23","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1080\/00207169008803803","volume":"31","author":"PM Pardalos","year":"1990","unstructured":"Pardalos, P. M., & Nagurney, A. (1990). The integer linear complementarity problem. International Journal of Computer Mathematics, 31(3\u20134), 205\u2013214.","journal-title":"International Journal of Computer Mathematics"},{"issue":"3","key":"2926_CR24","doi-asserted-by":"publisher","first-page":"1334","DOI":"10.1109\/TPWRS.2012.2184562","volume":"27","author":"C Ruiz","year":"2012","unstructured":"Ruiz, C., Conejo, A. J., & Gabriel, S. A. (2012). Pricing non-convexities in an electricity pool. IEEE Transactions on Power Systems, 27(3), 1334\u20131342.","journal-title":"IEEE Transactions on Power Systems"},{"key":"2926_CR25","unstructured":"Schrijver, A. (1986). Theory of linear and integer programming. Toronto: Wiley"},{"key":"2926_CR26","unstructured":"Takayama, T., & Judge, G. G. (1971). Spatial and temporal price allocation models. Amsterdam: North-Holland."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-018-2926-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2926-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2926-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T23:20:37Z","timestamp":1560468037000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-018-2926-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,14]]},"references-count":26,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["2926"],"URL":"https:\/\/doi.org\/10.1007\/s10479-018-2926-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,14]]},"assertion":[{"value":"14 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}