Branch-and-Reduction Algorithm for Indefinite Quadratic Programming Problem
This paper presents a rectangular branch-and-reduction algorithm for globally solving indefinite quadratic programming problem (IQPP), which has a wide application in engineering design and optimization. In this algorithm, first of all, we convert the IQPP into an equivalent bilinear optimization pr...
Gorde:
| Egile Nagusiak: | , , |
|---|---|
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
Wiley
2021-01-01
|
| Saila: | Complexity |
| Sarrera elektronikoa: | http://dx.doi.org/10.1155/2021/5578427 |
| Etiketak: |
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|