Author(s):
Júdice, Joaquim 
; Faustino, Ana ; Ribeiro, Isabel
Date: 2002
Persistent ID: http://hdl.handle.net/10316/7722
Origin: Estudo Geral - Universidade de Coimbra
Document details
On the solution of NP-hard linear complementarity problems
Description
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. http://dx.doi.org/10.1007/BF02578944
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. http://dx.doi.org/10.1007/BF02578944
Document Type
Article
Language English
Language English
| Financiadores do RCAAP | |||||||
|
|
|
|
|
|
||