DSpace Repository

A Method for Binary Quadratic Programming with Circulant Matrix

Show simple item record

dc.contributor.author ISTRATI, Daniela
dc.contributor.author MORARU, Vasile
dc.contributor.author ZAPOROJAN, Sergiu
dc.date.accessioned 2022-12-27T17:06:51Z
dc.date.available 2022-12-27T17:06:51Z
dc.date.issued 2022
dc.identifier.citation ISTRATI, Daniela, MORARU, Vasile, ZAPOROJAN, Sergiu. A Method for Binary Quadratic Programming with Circulant Matrix. In: Electronics, Communications and Computing (IC ECCO-2022): 12th intern. conf., 20-21 Oct. 2022, Chişinău, Republica Moldova: conf. proc., Chişinău, 2022, pp. 154-157. en_US
dc.identifier.uri https://doi.org/10.52326/ic-ecco.2022/CS.01
dc.identifier.uri http://repository.utm.md/handle/5014/21847
dc.description.abstract 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. en_US
dc.language.iso en en_US
dc.publisher Technical University of Moldova en_US
dc.rights Attribution-NonCommercial-NoDerivs 3.0 United States *
dc.rights.uri http://creativecommons.org/licenses/by-nc-nd/3.0/us/ *
dc.subject binary quadratic programming en_US
dc.subject circulant matrix en_US
dc.subject Fourier matrix en_US
dc.subject separable programming en_US
dc.subject relaxed problem en_US
dc.title A Method for Binary Quadratic Programming with Circulant Matrix en_US
dc.type Article en_US


Files in this item

The following license files are associated with this item:

This item appears in the following Collection(s)

  • 2022
    Proceedings of the 12th IC|ECCO; October 20-21, 2022

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 United States Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 United States

Search DSpace


Advanced Search

Browse

My Account