A continuous reformulation of the quadratic unconstrained  binary optimization problem

MORARU, Vasile; ZAPOROJAN, Sergiu

dc.contributor.author	MORARU, Vasile
dc.contributor.author	ZAPOROJAN, Sergiu
dc.date.accessioned	2021-10-11T13:24:12Z
dc.date.available	2021-10-11T13:24:12Z
dc.date.issued	2015
dc.identifier.citation	MORARU, Vasile, ZAPOROJAN, Sergiu. A continuous reformulation of the quadratic unconstrained binary optimization problem. In: Modelling and Development of Intelligent Systems: proc. Fourth International Conference, 28 October – 1 November, 2015, Sibiu, Romania, 2015, pp. 86-91.	en_US
dc.identifier.uri	http://repository.utm.md/handle/5014/17679
dc.description.abstract	In this paper we consider the Quadratic Unconstrained Binary Optimization (QUBO) Problem. Using a suitable function and penalty parameter we can reformulate the original QUBO problem as a continuous program. It is shown that the problem of large size can be reduced to two constraints. A new convex formulation is then proposed.	en_US
dc.language.iso	en	en_US
dc.publisher	“Lucian Blaga” University	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 optimization	en_US
dc.title	A continuous reformulation of the quadratic unconstrained binary optimization problem	en_US
dc.type	Article	en_US