Autor(es):
Júdice, Joaquim 
; Faustino, Ana ; Ribeiro, Isabel
Data: 2002
Identificador Persistente: http://hdl.handle.net/10316/7722
Origem: Estudo Geral - Universidade de Coimbra
Detalhes do Documento
On the solution of NP-hard linear complementarity problems
Descrição
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
Tipo de Documento
Artigo
Idioma Inglês
Idioma Inglês
| Financiadores do RCAAP | |||||||
|
|
|
|
|
|
||