Results 11 to 20 of about 18,556 (186)
On the hardness of quadratic unconstrained binary optimization problems
Frontiers in Physics, 2022 We use exact enumeration to characterize the solutions of quadratic unconstrained binary optimization problems of less than 21 variables in terms of their distributions of Hamming distances to close-by solutions.
V. Mehta +7 more
doaj +7 more sources
Quadratic Unconstrained Binary Optimization for the Automotive Paint Shop Problem
IEEE Access, 2023 The Binary Paint Shop Problem (BPSP) is a combinatorial optimization problem which draws inspiration from the automotive paint shop. Its binary nature, making it a good fit for Quadratic Unconstrained Binary Optimization (QUBO) solvers, has been well ...
Pieter Debevere +2 more
doaj +2 more sources
Efficient digital quadratic unconstrained binary optimization solvers for SAT problems
New Journal of PhysicsBoolean satisfiability (SAT) is a propositional logic problem of determining whether an assignment of variables satisfies a Boolean formula. Many combinatorial optimization problems can be formulated in Boolean SAT logic—either as k -SAT decision ...
Robert Simon Fong +2 more
doaj +3 more sources
Variable Reduction For Quadratic Unconstrained Binary Optimization
CoRR, 2021 Quadratic Unconstrained Binary Optimization models are useful for solving a diverse range of optimization problems. Constraints can be added by incorporating quadratic penalty terms into the objective, often with the introduction of slack variables needed for conversion of inequalities. This transformation can lead to a significant increase in the size
Amit Verma, Mark W. Lewis
openaire +2 more sources
Performance Comparison of Typical Binary-Integer Encodings in an Ising Machine
IEEE Access, 2021 The differences in performance among binary-integer encodings in an Ising machine, which can solve combinatorial optimization problems, are investigated.
Kensuke Tamura +4 more
doaj +1 more source
Quantum Algorithms for Mixed Binary Optimization Applied to Transaction Settlement
IEEE Transactions on Quantum Engineering, 2021 In this article, we extend variational quantum optimization algorithms for quadratic unconstrained binary optimization problems to the class of mixed binary optimization problems.
Lee Braine +3 more
doaj +1 more source
Qubit Reduction and Quantum Speedup for Wireless Channel Assignment Problem
IEEE Transactions on Quantum Engineering, 2023 In this article, we propose a novel method of formulating an NP-hard wireless channel assignment problem as a higher-order unconstrained binary optimization (HUBO), where the Grover adaptive search (GAS) is used to provide a quadratic speedup for solving
Yuki Sano +2 more
doaj +1 more source
Greedy permanent magnet optimization
Nuclear Fusion, 2023 A number of scientific fields rely on placing permanent magnets in order to produce a desired magnetic field. We have shown in recent work that the placement process can be formulated as sparse regression.
Alan A. Kaptanoglu +2 more
doaj +1 more source
Computational Complexity of Quadratic Unconstrained Binary Optimization
CoRR, 2021 In this paper, we study the computational complexity of the quadratic unconstrained binary optimization (QUBO) problem under the functional problem FP^NP categorization. We focus on four sub-classes: (1) When all coefficients are integers QUBO is FP^NP-complete.
openaire +2 more sources
Power Network Optimization: A Quantum Approach
IEEE Access, 2023 Optimization of electricity surplus is a crucial element for transmission power networks since it leads to reducing costs as well as increasing efficiency across the network as a whole.
Giuseppe Colucci +2 more
doaj +1 more source