Results 161 to 170 of about 1,712 (186)

The unconstrained binary quadratic programming problem: a survey [PDF]

Journal of Combinatorial Optimization, 2014
In recent years the unconstrained binary quadratic program (UBQP) has grown in importance in the field of combinatorial optimization due to its application potential and its computational challenge. Research on UBQP has generated a wide range of solution
Fred Glover, Jin-Kao Hao, Mark Lewis
exaly   +3 more sources

A hybrid metaheuristic for multiobjective unconstrained binary quadratic programming [PDF]

Applied Soft Computing Journal, 2014
International audienceThe conventional Unconstrained Binary Quadratic Programming (UBQP) problem is known to be a unified modeling and solution framework for many combinatorial optimization problems.
Jin-Kao Hao, Sébastien Verel, Arnaud Liefooghe   +2 more
exaly   +3 more sources

A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) [PDF]

Discrete Optimization, 2008
The “roof dual” of a QUBO (Quadratic Unconstrained Binary Optimization) problem has been introduced in [P.L. Hammer, P. Hansen, B. Simeone, Roof duality, complementation and persistency in quadratic 0–1 optimization, Mathematical Programming 28 (1984 ...
Endre Boros, Peter L Hammer
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

A Collaborative Neurodynamic Algorithm for Quadratic Unconstrained Binary Optimization

IEEE Transactions on Emerging Topics in Computational Intelligence
Jun Wang, Hongzong Li
exaly   +2 more sources

How to Approximate any Objective Function via Quadratic Unconstrained Binary Optimization [PDF]

, 2022
Quadratic unconstrained binary optimization (QUBO) has become the standard format for optimization using quantum computers, i.e., for both the quantum approximate optimization algorithm (QAOA) and quantum annealing (QA).
Thomas Gabor, Claudia Linnhoff-Popien
exaly   +2 more sources

High‐throughput FPGA implementation for quadratic unconstrained binary optimization

Concurrency and Computation: Practice and Experience, 2021
AbstractQuadratic unconstrained binary optimization (QUBO) is a combinatorial optimization problem. Since various NP‐hard problems such as the traveling salesman problem can be formulated as a QUBO instance, QUBO is used with a wide range of applications.
Hiroshi Kagawa, Yasuaki Ito, Koji Nakano, Ryota Yasudo, Yuya Kawamata, Ryota Katsuki, Yusuke Tabata, Takashi Yazane, Kenichiro Hamano   +8 more
openaire   +1 more source

Probabilistic reasoning as quadratic unconstrained binary optimization

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2022
Probabilistic reasoning is an important tool for using uncertainty in AI, especially for automated reasoning. Partial probability assessments are a way of expressing partial probabilistic knowledge on a set of events. These assessments contain only the information about "interesting"events (hence it can be easily assessed by an expert).
openaire   +2 more sources

Quadratic Unconstrained Binary Optimization (QUBO) on neuromorphic computing system

2017 International Joint Conference on Neural Networks (IJCNN), 2017
The problems of Artificial intelligence (AI) naturally maps to NP-hard optimization problems. This trend has significance to achieve human-level computation capability from machines. This computational ability can be achieved by developing evolutionary algorithms or mapping those evolutionary algorithms onto new generation computing systems: Quantum or
Md. Zahangir Alom, Brian Van Essen, Adam T. Moody, David Peter Widemann, Tarek M. Taha   +4 more
openaire   +1 more source

Sufficient optimal conditions for unconstrained quadratic binary problems

12th International Symposium on Operations Research and its Applications in Engineering, Technology and Management (ISORA 2015), 2015
In this article, we present several sufficient optimal conditions for unconstrained quadratic binary problems, which can be applied in algorithms combining with SDP relaxations in branch-and-bound approaches for the primal problem. These optimal conditions can work for many situations when the Lagrangian duality gap is not zero.
null Liu Liu, null Qiuling Xie, null Chunli Liu   +2 more
openaire   +1 more source

A large population island framework for the unconstrained binary quadratic problem [PDF]

Computers and Operations Research
International audienceThe unconstrained binary quadratic problem is an NP-hard problem and has applications in many fields. Recently, the problem has attracted much interest in the field of quantum optimization, as it is directly related to the Ising ...
Olivier Goudet, Jin-Kao Hao
exaly   +2 more sources