{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T20:35:59Z","timestamp":1759091759227},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Top"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1007\/bf02578944","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T17:13:25Z","timestamp":1174583605000},"page":"125-145","source":"Crossref","is-referenced-by-count":6,"title":["On the solution of NP-hard linear complementarity problems"],"prefix":"10.1007","volume":"10","author":[{"given":"Joaquim J.","family":"J\u00fadice","sequence":"first","affiliation":[]},{"given":"Ana M.","family":"Faustino","sequence":"additional","affiliation":[]},{"given":"Isabel Martins","family":"Ribeiro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02578944_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BFb0121176","volume":"31","author":"F. Al-Khayyal","year":"1987","unstructured":"Al-Khayyal F. (1987). An implicit enumeration procedure for the general linear complementarity problem.Mathematical Programming Studies 31, 1\u201320.","journal-title":"Mathematical Programming Studies"},{"key":"BF02578944_CR2","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1287\/mnsc.30.8.1004","volume":"30","author":"W. Bialas","year":"1984","unstructured":"Bialas W. and Karwan M. (1984). Two-level linear programming.Management Science 30, 1004\u20131020.","journal-title":"Management Science"},{"key":"BF02578944_CR3","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/BF00940344","volume":"60","author":"S. Chung","year":"1989","unstructured":"Chung S. (1989). NP-completeness of the linear complementarity problems.Journal of Optimization Theory and Applications 60, 393\u2013399.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"BF02578944_CR4","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s101070050112","volume":"87","author":"A.R. Conn","year":"2000","unstructured":"Conn A.R., Gould N-I., Orban D. and Toint Ph.L. (2000). A primal-dual trust-region algorithm for non-convex nonlinear programming.Mathematical Programming 87, 215\u2013249.","journal-title":"Mathematical Programming"},{"key":"BF02578944_CR5","unstructured":"Cottle R., Pang J. and Stone R. (1992).The linear complementarity problem. Academic Press."},{"key":"BF02578944_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s002450010021","volume":"43","author":"L. Fernandes","year":"2001","unstructured":"Fernandes L., Friedlander A., Guedes M.C. and J\u00fadice J. (2001). Solution of a general linear complementarity problem using smooth optimization and its application to bilinear programming andLCP, Applied Mathematics and Optimization 43, 1\u201319.","journal-title":"Applied Mathematics and Optimization"},{"key":"BF02578944_CR7","doi-asserted-by":"crossref","unstructured":"Floudas C. (2000).Deterministic global optimization: theory, methods and applications. Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4757-4949-6"},{"key":"BF02578944_CR8","unstructured":"Gay D.M., Overton M.L. and Wright M.H. (1998). A primal-dual interior-point method for nonconvex programming. In: Yuan Y. (ed.)Advances in Nonlinear Programming. Kluwer Academic Publishers, 31\u201356."},{"key":"BF02578944_CR9","unstructured":"Horst R., Pardalos P. and Thoai N.V. (1995).Introduction to global optimization. Kluwer Academic Publishers."},{"key":"BF02578944_CR10","unstructured":"IBM Corporation (1992). IBM optimization subroutine library guide and reference.IBM Systems Journal 31."},{"key":"BF02578944_CR11","first-page":"77","volume":"8","author":"J. J\u00fadice","year":"1988","unstructured":"J\u00fadice J. and Faustino A. (1988a). The solution of the linear bilevel programming problem by using the complementarity problem.Investiga\u00e7\u00e3o Operational 8, 77\u201395.","journal-title":"Investiga\u00e7\u00e3o Operational"},{"key":"BF02578944_CR12","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/0305-0548(88)90058-5","volume":"15","author":"J. J\u00fadice","year":"1988","unstructured":"J\u00fadice J. and Faustino A. (1988b). An experimental investigation of enumerative methods for the linear complementarity problem.Computers and Operations Research 15, 417\u2013426.","journal-title":"Computers and Operations Research"},{"key":"BF02578944_CR13","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1016\/0305-0548(91)90002-9","volume":"18","author":"J. J\u00fadice","year":"1991","unstructured":"J\u00fadice J. and Faustino A. (1991). A computational analysis of LCP methods for bilinear and concave quadratic programming.Computers and Operations Research 18, 645\u2013654.","journal-title":"Computers and Operations Research"},{"key":"BF02578944_CR14","doi-asserted-by":"crossref","unstructured":"J\u00fadice J., Fernandes L. and Lima A. (1996). On the solution of the monotone and nonmonotone linear complementarity problem by an infeasible interior point algorithm. In: Pillo G.D. and Giannessi F. (eds.),Nonlinear Optimization and Applications. Plenum Press, 213\u2013227.","DOI":"10.1007\/978-1-4899-0289-4_15"},{"key":"BF02578944_CR15","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/BF01099266","volume":"4","author":"J. J\u00fadice","year":"1994","unstructured":"J\u00fadice J. and Vicente L.N. (1994). On the solution and complexity of a generalized linear complementarity problem.Journal of Global Optimization 4, 415\u2013424.","journal-title":"Journal of Global Optimization"},{"key":"BF02578944_CR16","doi-asserted-by":"crossref","unstructured":"Kojima M., Megiddo N., Noma T. and Yoshise A. (1991).A unified approach to interior-point algorithms for linear complementarity problems. Lecture Notes in Computer Science 538, Springer-Verlag.","DOI":"10.1007\/3-540-54509-3"},{"key":"BF02578944_CR17","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF01580367","volume":"11","author":"H. Konno","year":"1976","unstructured":"Konno H. (1976). A cutting-plane algorithm for solving bilinear programs.Mathematical Programming 11, 14\u201327.","journal-title":"Mathematical Programming"},{"key":"BF02578944_CR18","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01096765","volume":"6","author":"O.L. Mangasarian","year":"1995","unstructured":"Mangasarian O.L. (1995). The linear complementarity problem as a separable bilinear program.Journal of Global Optimization 6, 153\u2013161.","journal-title":"Journal of Global Optimization"},{"key":"BF02578944_CR19","unstructured":"Murty K. (1983).Linear programming. John Wiley."},{"key":"BF02578944_CR20","unstructured":"Murty K. (1988).Linear complementarity, linear and nonlinear programming. Heldermann Verlag."},{"key":"BF02578944_CR21","first-page":"162","volume":"33","author":"K. Murty","year":"1996","unstructured":"Murty K. and J\u00fadice J. (1996). On the complexity of finding stationary points of nonconvex quadratic programming.Opsearch 33, 162\u2013166.","journal-title":"Opsearch"},{"key":"BF02578944_CR22","doi-asserted-by":"crossref","unstructured":"Nocedal J. and Wright S. (1999).Numerical optimization, Springer Verlag.","DOI":"10.1007\/b98874"},{"key":"BF02578944_CR23","doi-asserted-by":"crossref","unstructured":"Sherali H. and Adams W. (1999).A reformulation-linearization technique for solving discrete and continuous nonconvex problems. Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4757-4388-3"},{"key":"BF02578944_CR24","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1023\/A:1021734613201","volume":"99","author":"H. Sherali","year":"1998","unstructured":"Sherali H., Krishnamurty R. and Al-Khayyal F. (1998). Enumeration approach for linear complementarity problems based on a reformulation-linearization technique.Journal of Optimization Theory and Applications 99, 481\u2013507.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"BF02578944_CR25","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1023\/A:1008677427361","volume":"13","author":"R.J. Vanderbei","year":"1999","unstructured":"Vanderbei R.J. and Shanno D.F. (1999). An interior-point algorithm for nonconvex nonlinear programming.Computational Optimization and Applications 13, 231\u2013252.","journal-title":"Computational Optimization and Applications"},{"key":"BF02578944_CR26","doi-asserted-by":"crossref","unstructured":"Wright S. (1997).Primal-dual interior-point methods. SIAM.","DOI":"10.1137\/1.9781611971453"}],"container-title":["Top"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02578944.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02578944\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02578944","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T12:44:55Z","timestamp":1558183495000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02578944"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["BF02578944"],"URL":"https:\/\/doi.org\/10.1007\/bf02578944","relation":{},"ISSN":["1134-5764","1863-8279"],"issn-type":[{"value":"1134-5764","type":"print"},{"value":"1863-8279","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}