{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:52:51Z","timestamp":1770994371496,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,4,26]],"date-time":"2006-04-26T00:00:00Z","timestamp":1146009600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2006,9]]},"DOI":"10.1007\/s10898-006-9001-8","type":"journal-article","created":{"date-parts":[[2006,4,25]],"date-time":"2006-04-25T16:41:27Z","timestamp":1145983287000},"page":"89-114","source":"Crossref","is-referenced-by-count":28,"title":["A Complementarity-based Partitioning and Disjunctive Cut Algorithm for Mathematical Programming Problems with Equilibrium Constraints"],"prefix":"10.1007","volume":"36","author":[{"given":"Joaquim J.","family":"J\u00fadice","sequence":"first","affiliation":[]},{"given":"Hanif D.","family":"Sherali","sequence":"additional","affiliation":[]},{"given":"Isabel M.","family":"Ribeiro","sequence":"additional","affiliation":[]},{"given":"Ana M.","family":"Faustino","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,4,26]]},"reference":[{"key":"9001_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E. Balas","year":"1979","unstructured":"Balas E. (1979), Disjunctive programming, Annals of Discrete Mathematics 5, 3\u201351","journal-title":"Annals of Discrete Mathematics"},{"key":"9001_CR2","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0911017","volume":"11","author":"J. Bard","year":"1990","unstructured":"Bard J., Moore J. (1990). A branch-and-bound algorithm for the bilevel linear program. SIAM Journal on Scientific and Statistical Computing 11:281\u2013292","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"9001_CR3","doi-asserted-by":"crossref","first-page":"999","DOI":"10.1109\/18.256506","volume":"39","author":"L. Breiman","year":"1993","unstructured":"Breiman L. (1993). Hinging hyperplanes for regression, classification and function approximation. IEEE Transactions on Information Theory 39:999\u20131013","journal-title":"IEEE Transactions on Information Theory"},{"key":"9001_CR4","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0914049","volume":"14","author":"P. Calamai","year":"1993","unstructured":"Calamai P. and Vicente L. (1993), Generating linear and linear-quadratic bilevel programming problems. SIAM Journal on Scientific Computing 14:770\u2013782","journal-title":"SIAM Journal on Scientific Computing"},{"key":"9001_CR5","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/174603.174411","volume":"20","author":"P. Calamai","year":"1994","unstructured":"Calamai P. and Vicente L. (1994), Generating quadratic bilevel programming test problems. ACM Transactions on Mathematical Software 20:103\u2013119","journal-title":"ACM Transactions on Mathematical Software"},{"key":"9001_CR6","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s10107990015a","volume":"85","author":"F. Facchinei","year":"1999","unstructured":"Facchinei F., Jiang H. and Qi L. (1999), A smoothing method for mathematical programs with equilibrium constraints. Mathematical Programming 85:107\u2013134","journal-title":"Mathematical Programming"},{"issue":"1","key":"9001_CR7","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1137\/S105262340038081X","volume":"13","author":"R. Fletcher","year":"2002","unstructured":"Fletcher R., Leyffer S. and Toint P. (2002). On the global convergence of a filter-sqp algorithm. SIAM Journal on Optimization 13(1):44\u201359","journal-title":"SIAM Journal on Optimization"},{"key":"9001_CR8","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1018359900133","volume":"10","author":"M. Fukushima","year":"1998","unstructured":"Fukushima M., Luo Z. and Pang J. (1998), A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints. Computational Optimization and Applications 10:5\u201334","journal-title":"Computational Optimization and Applications"},{"issue":"5","key":"9001_CR9","doi-asserted-by":"crossref","first-page":"1194","DOI":"10.1137\/0913069","volume":"13","author":"P. Hansen","year":"1992","unstructured":"Hansen P., Jaumard B. and Savard G. (1992), New branch-and-bound rules for linear bilevel programming. SIAM Journal on Scientific Computing 13(5):1194\u20131217","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"3","key":"9001_CR10","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1137\/S1052623497332329","volume":"10","author":"H. Jiang","year":"2000","unstructured":"Jiang H. and Ralph D. (2000). Smooth sqp methods for mathematical programs with nonlinear complementarity constraints. SIAM Journal on Optimization 10(3):779\u2013808","journal-title":"SIAM Journal on Optimization"},{"key":"9001_CR11","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":"9001_CR12","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF02098174","volume":"34","author":"J. J\u00fadice","year":"1992","unstructured":"J\u00fadice J. and Faustino A. (1992), A sequential lcp algorithm for bilevel linear programming. Annals of Operations Research 34: 89\u2013106","journal-title":"Annals of Operations Research"},{"issue":"1","key":"9001_CR13","first-page":"125","volume":"10","author":"J. J\u00fadice","year":"2002","unstructured":"J\u00fadice J., Faustino A. and Ribeiro I. (2002). On the solution of np-hard linear complementarity problems. TOP- Sociedad de Estat\u00edstica e Investigacion Operativa 10(1):125\u2013145","journal-title":"TOP- Sociedad de Estat\u00edstica e Investigacion Operativa"},{"key":"9001_CR14","unstructured":"J\u00fadice, J., Sherali, H., Ribeiro, I. and Faustino, A. (2005), A complementarity active-set algorithm for mathematical programming problems with equilibrium constraints, Working Paper."},{"key":"9001_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. (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":"9001_CR16","volume-title":"Mathematical Programs with Equilibrium Constraints","author":"Z. Luo","year":"1997","unstructured":"Luo Z., Pang J. and Ralph D. (1997). Mathematical Programs with Equilibrium Constraints. Cambridge University Press, New York"},{"key":"9001_CR17","doi-asserted-by":"crossref","unstructured":"Murtagh, B. and Saunders, A. (1983), MINOS 5.0 User\u2019s Guide, Technical Report SOL 83-20, Department of Operations Research, Stanford University.","DOI":"10.21236\/ADA138522"},{"key":"9001_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J. Nocedal","year":"1999","unstructured":"Nocedal J. and Wright S. (1999). Numerical Optimization. Springer-Verlag, New York, N.Y"},{"key":"9001_CR19","doi-asserted-by":"crossref","first-page":"1310","DOI":"10.1109\/18.669422","volume":"44","author":"P. Pucar","year":"1998","unstructured":"Pucar P. and Sjoberg J. (1998), On the hinge finding algorithm for hinging hyperplanes. IEEE Transactions on Information Theory 44:1310\u20131318","journal-title":"IEEE Transactions on Information Theory"},{"key":"9001_CR20","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0305-0548(02)00179-X","volume":"31","author":"M. Queiroz","year":"2004","unstructured":"Queiroz M., Humes Jr C. and J\u00fadice J. (2004). On finding global optima for the hinge fitting problem. Computers and Operations Research 31:101\u2013122","journal-title":"Computers and Operations Research"},{"key":"9001_CR21","volume-title":"Global Optimization and Applications to Structural Engineering (in Portuguese)","author":"I. Ribeiro","year":"2005","unstructured":"Ribeiro I. (2005). Global Optimization and Applications to Structural Engineering (in Portuguese). PhD thesis, University of Porto, Porto"},{"key":"9001_CR22","unstructured":"Scholtes, S. (1999), Active set methods for inverse linear complementarity problems, Judge Institute of Management Research Paper Series No. 28\/1999."},{"key":"9001_CR23","doi-asserted-by":"crossref","unstructured":"Sherali, H. and Shetty, C. (1980), Optimization with disjunctive constraints, In: Beckman, M. and K\u00fcnzi, H. (eds.), Lecture Notes in Economics and Mathematical Systems, Vol. 181, Springer-Verlag, New York, N.Y.","DOI":"10.1007\/978-3-642-48794-1"},{"key":"9001_CR24","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF01096412","volume":"3","author":"D. White","year":"1993","unstructured":"White D. and Annandalingam G. (1993). A penalty function approach for solving bilevel linear programs. Journal of Global Optimization 3:397\u2013419","journal-title":"Journal of Global Optimization"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-006-9001-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-006-9001-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-006-9001-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,14]],"date-time":"2020-04-14T04:56:20Z","timestamp":1586840180000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-006-9001-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,4,26]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,9]]}},"alternative-id":["9001"],"URL":"https:\/\/doi.org\/10.1007\/s10898-006-9001-8","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,4,26]]}}}