Please use this identifier to cite or link to this item:
https://hdl.handle.net/10216/99207| Author(s): | Joaquim J. Júdice Ana M. Faustino Isabel Martins Ribeiro |
| Title: | On the solution of NP-hard linear complementarity problem |
| Issue Date: | 2002 |
| Abstract: | In this paper two enumerative algorithms for the Linear Complementarity Problems (LCP) are discussed. These procedures exploit the equivalence of the LCP into a nonconvex quadratic and a bilinear programs. It is shown that these algorithms are efficient for processing NP-hard LCPs associated with reformulations of the Knapsack problem and should be recommended to solve difficult LCPs. |
| Subject: | Investigação operacional, Matemática Operations research, Mathematics |
| Scientific areas: | Ciências exactas e naturais::Matemática Natural sciences::Mathematics |
| URI: | https://hdl.handle.net/10216/99207 |
| Document Type: | Artigo em Revista Científica Internacional |
| Rights: | restrictedAccess |
| Appears in Collections: | FEUP - Artigo em Revista Científica Internacional |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 67667.pdf Restricted Access | 2.89 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.