CRIS of TUM
Current Research Information System (CRIS) of the Technical University of Moldova (TUM) is an open access system gathering information and digital material relating to the various research and innovation entities and activities of TUM: researchers, research units, publications, patents, thesis, awards, events, equipment, services and other.
Please use this identifier to cite or link to this item:
http://cris.utm.md/handle/5014/2045| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | ISTRATI, Daniela | en_US |
| dc.contributor.author | MORARU, Vasile | en_US |
| dc.contributor.author | ZAPOROJAN, Sergiu | en_US |
| dc.date.accessioned | 2023-11-29T13:00:43Z | - |
| dc.date.available | 2023-11-29T13:00:43Z | - |
| dc.date.issued | 2022 | - |
| dc.identifier.citation | Istrati, D., Moraru, V., & Zaporojan, S. (2022). A Method for Binary Quadratic Programming with Circulant Matrix. Proceedings of the 12th International Conference on “Electronics, Communications and Computing". | en_US |
| dc.identifier.uri | https://www.semanticscholar.org/paper/A-Method-for-Binary-Quadratic-Programming-with-Istrati-Moraru/1cc47cb5e8fa4fe7f2aaec4486abd913516abbc9 | - |
| dc.identifier.uri | http://cris.utm.md/handle/5014/2045 | - |
| 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.subject | Binary nonconvex quadratic problems | 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.subject | DC algorithm | en_US |
| dc.title | A Method for Binary Quadratic Programming with Circulant Matrix | en_US |
| dc.type | Article | en_US |
| dc.relation.conference | Electronics, Communications and Computing | en_US |
| item.grantfulltext | open | - |
| item.fulltext | With Fulltext | - |
| item.languageiso639-1 | other | - |
| crisitem.author.orcid | 0000-0001-5928-4229 | - |
| Appears in Collections: | Proceedings Papers | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 7fa29f99a641192b57cc8037ab6387d7459b.pdf | 648.47 kB | Adobe PDF | View/Open |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.