Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/7722| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Júdice, Joaquim | - |
| dc.contributor.author | Faustino, Ana | - |
| dc.contributor.author | Ribeiro, Isabel | - |
| dc.date.accessioned | 2009-02-17T11:18:34Z | - |
| dc.date.available | 2009-02-17T11:18:34Z | - |
| dc.date.issued | 2002 | en_US |
| dc.identifier.citation | TOP. 10:1 (2002) 125-145 | en_US |
| dc.identifier.uri | https://hdl.handle.net/10316/7722 | - |
| dc.description.abstract | Abstract In this paper two enumerative algorithms for the Linear Complementarity Problems (LCP) are discussed. These procedures exploit the equivalence of theLCP into a nonconvex quadratic and a bilinear programs. It is shown that these algorithms are efficient for processing NP-hardLCPs associated with reformulations of the Knapsack problem and should be recommended to solve difficultLCPs. | en_US |
| dc.language.iso | eng | eng |
| dc.rights | openAccess | eng |
| dc.title | On the solution of NP-hard linear complementarity problems | en_US |
| dc.type | article | en_US |
| dc.identifier.doi | 10.1007/BF02578944 | en_US |
| item.grantfulltext | open | - |
| item.fulltext | Com Texto completo | - |
| item.openairetype | article | - |
| item.languageiso639-1 | en | - |
| item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
| item.cerifentitytype | Publications | - |
| crisitem.author.orcid | 0000-0001-9441-4877 | - |
| Appears in Collections: | FCTUC Matemática - Artigos em Revistas Internacionais | |
Page view(s) 50
455
checked on Apr 23, 2024
Download(s) 50
439
checked on Apr 23, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.