| Articolul precedent |
| Articolul urmator |
 |
 198 8 |
| Ultima descărcare din IBN: 2024-01-26 09:19 |
 SM ISO690:2012ISTRATI, Daniela, MORARU, Vasile, ZAPOROJAN, Sergiu. A Method for Binary Quadratic Programming with circulant matrix. In: Electronics, Communications and Computing, Ed. 12, 20-21 octombrie 2022, Chişinău. Chișinău: Tehnica-UTM, 2023, Editia 12, pp. 154-157. DOI: https://doi.org/10.52326/ic-ecco.2022/CS.01 |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
| Electronics, Communications and Computing Editia 12, 2023 |
||||||
|
Conferința "Electronics, Communications and Computing" 12, Chişinău, Moldova, 20-21 octombrie 2022 | ||||||
|
||||||
| DOI:https://doi.org/10.52326/ic-ecco.2022/CS.01 | ||||||
| Pag. 154-157 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
Binary quadratic programming is a classical combinatorial optimization problem that has many real-world applications. This paper presents a method for solving the quadratic programming problem with circulant matrix by reformulating and relaxing it into a separable optimization problem. The proposed method determines local suboptimal solutions. To solve the relaxing problem, the DCA algorithm it is proposed to calculate the solutions, in the general case, only local suboptimal. |
||||||
| Cuvinte-cheie Binary nonconvex quadratic problems, circulant matrix, Fourier matrix, separable programming, relaxed problem, DC algorithm |
||||||
|
|
|
|
