RUcore: Rutgers University Community Repository
New algorithms for Quadratic Unconstrained Binary Optimization (QUBO) with applications in engineering and social sciences
Descriptive
TypeOfResource
Text
TitleInfo
(ID = T-1)
Title
New algorithms for Quadratic Unconstrained Binary Optimization (QUBO) with applications in engineering and social sciences
Identifier
ETD_934
Identifier
(type = hdl)
http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051095
Language
LanguageTerm
(authority = ISO639-2);
(type = code)
eng
Genre
(authority = marcgt)
theses
Subject
(ID = SBJ-1);
(authority = RUETD)
Topic
Operations Research
Subject
(ID = SBJ-1);
(authority = ETD-LCSH)
Topic
Mathematical optimization
Abstract
This dissertation investigates the Quadratic Unconstrained Binary Optimization (QUBO) problem, i.e. the problem of minimizing a quadratic function in binary variables. QUBO is studied at two complementary levels. First, there is an algorithmic aspect that tells how to preprocess the problem, how to find heuristics, how to get improved bounds and how to solve the problem with all the above ingredients.
Second, there is a practical aspect that uses QUBO to solve various applications from the engineering and social sciences fields including: via minimization, 2D/3D Ising models, 1D Ising chain models, image binarization, hierarchical clustering, greedy graph coloring/partitioning, MAX-2-SAT, MIN-VC, MAX-CLIQUE, MAX-CUT, graph stability and minimum k-partition.
Several families of fast heuristics for QUBO are analyzed, which include a novel probabilistic based class of methods.
It is shown that there is a unique maximal set of persistencies for the linearization model for QUBO.
This set is determined in polynomial time by a maximum flow followed by the computation of the strong components of a network that has 2n+2 nodes, where n is the number of variables. The identification of the above persistencies leads to a unique decomposition of the function, such that each component can be optimized separately. To find further persistencies, two additional techniques are proposed: one is based on the second order derivatives of Hammer et al. [HH81]; the other technique is a probing procedure on the two possible values of the variables.
These preprocessing tools work remarkably well for certain classes of problems.
We improved the Iterated Roof-Dual bound (IRD) of [BH89] by proposing two combinatorial methods: one was named the squeezed IRD; and the second was called the project-and-lift IRD method.
The cubic-dual bound can be found by means of linear programming by adding a set of triangle inequalities to the standard linearization, whose number is cubic in the number of variables. We show that this set can be reduced depending on the coefficients of the terms of the function. This leads to the possibility of computing the cubic-duals of larger QUBOs.
Second, there is a practical aspect that uses QUBO to solve various applications from the engineering and social sciences fields including: via minimization, 2D/3D Ising models, 1D Ising chain models, image binarization, hierarchical clustering, greedy graph coloring/partitioning, MAX-2-SAT, MIN-VC, MAX-CLIQUE, MAX-CUT, graph stability and minimum k-partition.
Several families of fast heuristics for QUBO are analyzed, which include a novel probabilistic based class of methods.
It is shown that there is a unique maximal set of persistencies for the linearization model for QUBO.
This set is determined in polynomial time by a maximum flow followed by the computation of the strong components of a network that has 2n+2 nodes, where n is the number of variables. The identification of the above persistencies leads to a unique decomposition of the function, such that each component can be optimized separately. To find further persistencies, two additional techniques are proposed: one is based on the second order derivatives of Hammer et al. [HH81]; the other technique is a probing procedure on the two possible values of the variables.
These preprocessing tools work remarkably well for certain classes of problems.
We improved the Iterated Roof-Dual bound (IRD) of [BH89] by proposing two combinatorial methods: one was named the squeezed IRD; and the second was called the project-and-lift IRD method.
The cubic-dual bound can be found by means of linear programming by adding a set of triangle inequalities to the standard linearization, whose number is cubic in the number of variables. We show that this set can be reduced depending on the coefficients of the terms of the function. This leads to the possibility of computing the cubic-duals of larger QUBOs.
PhysicalDescription
Form
(authority = gmd)
electronic resource
Extent
xxiii, 436 p. : ill.
InternetMediaType
application/pdf
InternetMediaType
text/xml
Note
(type = degree)
Ph.D.
Note
(type = bibliography)
Includes bibliographical references (p. 419-435)
Note
(type = statement of responsibility)
by Gabriel Tabares
Name
(ID = NAME-1);
(type = personal)
NamePart
(type = family)
Tavares
NamePart
(type = given)
Gabriel
Role
RoleTerm
(authority = RULIB);
(type = )
author
DisplayForm
Gabriel Tavares
Name
(ID = NAME-2);
(type = personal)
NamePart
(type = family)
Boros
NamePart
(type = given)
Endre
Role
RoleTerm
(authority = RULIB);
(type = )
internal member
Affiliation
Advisory Committee
DisplayForm
Endre Boros
Name
(ID = NAME-3);
(type = personal)
NamePart
(type = family)
Gurvich
NamePart
(type = given)
Vladimir
Role
RoleTerm
(authority = RULIB);
(type = )
internal member
Affiliation
Advisory Committee
DisplayForm
Vladimir Gurvich
Name
(ID = NAME-4);
(type = personal)
NamePart
(type = family)
Eckstein
NamePart
(type = given)
Jonathan
Role
RoleTerm
(authority = RULIB);
(type = )
internal member
Affiliation
Advisory Committee
DisplayForm
Jonathan Eckstein
Name
(ID = NAME-5);
(type = personal)
NamePart
(type = family)
Zabih
NamePart
(type = given)
Ramin
Role
RoleTerm
(authority = RULIB);
(type = )
outside member
Affiliation
Advisory Committee
DisplayForm
Ramin Zabih
Name
(ID = NAME-6);
(type = personal)
NamePart
(type = family)
Pr�kopa
NamePart
(type = given)
Andr�s
Role
RoleTerm
(authority = RULIB);
(type = )
chair
Affiliation
Advisory Committee
DisplayForm
Andr�s Pr�kopa
Name
(ID = NAME-7);
(type = personal)
NamePart
(type = family)
Vizv�ri
NamePart
(type = given)
B�la
Role
RoleTerm
(authority = RULIB);
(type = )
outside member
Affiliation
Advisory Committee
DisplayForm
B�la Vizv�ri
Name
(ID = NAME-1);
(type = corporate)
NamePart
Rutgers University
Role
RoleTerm
(authority = RULIB);
(type = )
degree grantor
Name
(ID = NAME-2);
(type = corporate)
NamePart
Graduate School - New Brunswick
Role
RoleTerm
(authority = RULIB);
(type = )
school
OriginInfo
DateCreated
(point = );
(qualifier = exact)
2008
DateOther
(qualifier = exact);
(type = degree)
2008-05
Place
PlaceTerm
(type = code)
xx
Location
PhysicalLocation
(authority = marcorg)
NjNbRU
RelatedItem
(type = host)
TitleInfo
Title
Rutgers University Electronic Theses and Dissertations
Identifier
(type = RULIB)
ETD
RelatedItem
(type = host)
TitleInfo
Title
Graduate School - New Brunswick Electronic Theses and Dissertations
Identifier
(type = local)
rucore19991600001
Identifier
(type = doi)
doi:10.7282/T3XK8FS2
Genre
(authority = ExL-Esploro)
ETD doctoral
Back to the top
Rights
RightsDeclaration
(AUTHORITY = GS);
(ID = rulibRdec0006)
The author owns the copyright to this work.
Copyright
Status
Copyright protected
Availability
Status
Open
RightsEvent
(AUTHORITY = rulib);
(ID = 1)
Type
Permission or license
Detail
Non-exclusive ETD license
AssociatedObject
(AUTHORITY = rulib);
(ID = 1)
Type
License
Name
Author Agreement License
Detail
I hereby grant to the Rutgers University Libraries and to my school the non-exclusive right to archive, reproduce and distribute my thesis or dissertation, in whole or in part, and/or my abstract, in whole or in part, in and from an electronic format, subject to the release date subsequently stipulated in this submittal form and approved by my school. I represent and stipulate that the thesis or dissertation and its abstract are my original work, that they do not infringe or violate any rights of others, and that I make these grants as the sole owner of the rights to my thesis or dissertation and its abstract. I represent that I have obtained written permissions, when necessary, from the owner(s) of each third party copyrighted matter to be included in my thesis or dissertation and will supply copies of such upon request by my school. I acknowledge that RU ETD and my school will not distribute my thesis or dissertation or its abstract if, in their reasonable judgment, they believe all such rights have not been secured. I acknowledge that I retain ownership rights to the copyright of my work. I also retain the right to use all or part of this thesis or dissertation in future works, such as articles or books.
Back to the top
Technical
ContentModel
ETD
MimeType
(TYPE = file)
application/pdf
MimeType
(TYPE = container)
application/x-tar
FileSize
(UNIT = bytes)
4044800
Checksum
(METHOD = SHA1)
e5df0b5287626c76cd7c9d6d25cb6aceaa4568da
Back to the top
Statistical Profile