Results 201 to 210 of about 43,906 (221)

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 class of exponential quadratically convergent iterative formulae for unconstrained optimization

Applied Mathematics and Computation, 2007
A nonlinear unconstraint optimization problem with an objective function depending: on one variable is considered. Three modifications of the Newton method for solving this problem are proposed. Each of the methods has an exponential iteration formula.
openaire   +1 more source

Computing the Barankin bound, by solving an unconstrained quadratic optimization problem

1997 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2002
The Barankin (1949) bound is the greatest lower bound on the variance of any unbiased estimate for a nonrandom parameter. Computing this bound yields, as a byproduct, an unbiased estimator that is at least locally best in the following sense. The estimator formula contains a reference parameter, when the unknown parameter happens to be equal to the ...
openaire   +1 more source

A Quadratic Unconstrained Binary Optimization Approach for Qubit Mapping

2023
Logische Bitoperationen sind die Grundbausteine von Computer Software. Hierbei werden Bits manipuliert, um verschiedene Aufgaben auszuführen, beispielsweise bitweise AND-, OR-, XOR- und NOT-Operationen. Dies ist der Quantensoftware sehr ähnlich.
openaire   +1 more source

Multistart Tabu Search Strategies for the Unconstrained Binary Quadratic Optimization Problem

Annals of Operations Research, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

The Quadratic Unconstrained Binary Optimization Problem

2022
openaire   +1 more source

An Efficient Closed-Form Formula for Evaluating r-Flip Moves in Quadratic Unconstrained Binary Optimization

Algorithms, 2023
Bahram Alidaee, Haibo Wang, Lutfu S Sua   +2 more
exaly  

Binary Unconstrained Quadratic Optimization Problem

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

Quadratic Unconstrained Binary Optimization (QUBO) Modeling

2023
openaire   +1 more source

Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems

European Journal of Operational Research, 2018
Fred Glover, Mark Lewis, Gary Kochenberger   +2 more
exaly