Carregant...
Carregant...

Vés al contingut (premeu Retorn)

The parallel approximability of a subclass of quadratic programming

Autor
Serna, M.; Xhafa, F.
Tipus d'activitat
Presentació treball a congrés
Nom de l'edició
1997 International Conference on Parallel and Distributed Systems
Any de l'edició
1997
Data de presentació
1997
Llibre d'actes
1997 International Conference on Parallel and Distributed Systems: December 10-1 3,1997, Seoul, Korea: proceedings
Pàgina inicial
474
Pàgina final
481
Editor
Institute of Electrical and Electronics Engineers (IEEE)
DOI
https://doi.org/10.1109/ICPADS.1997.652589 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/115216 Obrir en finestra nova
URL
http://ieeexplore.ieee.org/document/652589/ Obrir en finestra nova
Resum
In this paper we deal with the parallel approximability of a special class of Quadratic Programming (QP), called Smooth Positive Quadratic Programming. This subclass of QP is obtained by imposing restrictions on the coefficients of the QP instance. The Smoothness condition restricts the magnitudes of the coefficients while the positiveness requires that all the coefficients be non-negative. Interestingly, even with these restrictions several combinatorial problems can be modeled by Smooth QP. We...
Citació
Serna, M., Xhafa, F. The parallel approximability of a subclass of quadratic programming. A: IEEE International Conference on Parallel and Distributed Systems. "1997 International Conference on Parallel and Distributed Systems: December 10-1 3,1997, Seoul, Korea: proceedings". Institute of Electrical and Electronics Engineers (IEEE), 1997, p. 474-481.
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Participants

Arxius