Results 181 to 190 of about 108,734 (233)

Binary Unconstrained Quadratic Optimization Problem

2013
Gary A. Kochenberger, Fred Glover, Haibo Wang   +2 more
openaire   +2 more sources

A Collaborative Neurodynamic Algorithm for Quadratic Unconstrained Binary Optimization

IEEE Transactions on Emerging Topics in Computational Intelligence
Quadratic unconstrained binary optimization (QUBO) is a typical combinatorial optimization problem with widespread applications in science, engineering, and business.
Hongzong Li, Jun Wang
openaire   +2 more sources

Quadratic Unconstrained Binary Formulation for Traffic Signal Optimization on Real-World Maps

Journal of the Physical Society of Japan, 2023
The D-Wave quantum annealing machine can quickly find the optimal solution for quadratic unconstrained binary optimization (QUBO). One of the applications where the use of quantum annealing is desired is in problems requiring rapid calculations. One such
Reo Shikanai, Masayuki Ohzeki, Kazuyuki Tanaka   +2 more
semanticscholar   +1 more source

Enhancing Quantum Algorithms for Quadratic Unconstrained Binary Optimization via Integer Programming

ACM Transactions on Quantum Computing, 2023
To date, research in quantum computation promises potential for outperforming classical heuristics in combinatorial optimization. However, when aiming at provable optimality, one has to rely on classical exact methods like integer programming.
Friedrich Wagner, Jonas Nüßlein, F. Liers   +2 more
semanticscholar   +1 more source

Solving Quadratic Unconstrained Binary Optimization with Collaborative Spiking Neural Networks

2022 IEEE International Conference on Rebooting Computing (ICRC), 2022
Quadratic Unconstrained Binary Optimization (QUBO) problem becomes an attractive and valuable optimization problem formulation in that it can easily transform into a variety of other combinatorial optimization problems such as Graph/number Partition, Max-
Yan Fang, Ashwin Sanjay Lele
openaire   +2 more sources

Spectral bounds for unconstrained (−1,1)-quadratic optimization problems

European Journal of Operational Research, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ben-Ameur, Walid, Neto, José
openaire   +2 more sources

Testing optimality for quadratic 0?1 unconstrained problems

ZOR Zeitschrift f�r Operations Research Mathematical Methods of Operations Research, 1995
Summary: This paper analyses a necessary and sufficient condition for quadratic pseudo-Boolean unconstrained problems. It is proved that in general testing any necessary and sufficient optimality condition is a difficult task for any NP-hard problem. An \(\varepsilon\)-optimality condition is derived together with an approximation scheme to test it.
Carraresi, Paolo, Malucelli, Federico, Pappalardo, Massimo   +2 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

An encoding of argumentation problems using quadratic unconstrained binary optimization

Quantum Machine Intelligence
In this paper, we develop a way to encode several NP-Complete problems in Abstract Argumentation to Quadratic Unconstrained Binary Optimization (QUBO) problems.
Marco Baioletti, Francesco Santini
semanticscholar   +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