Results 51 to 60 of about 2,595,187 (128)
Algorithms in the theory of integral binary quadratic forms [PDF]
The classical ("old fashioned") theory of integral binary quadratic forms was developed by Gauss in his famous "Disquisitiones Arithmeticae". This thesis is concerned with the formal description and analysis of a selection of algorithms which make ...
Iliopoulos, C. S. (Costas S.)
core
International Transactions in Operational Research, Volume 33, Issue 5, Page 3128-3157, September 2026.Abstract We propose the novel p‐branch‐and‐bound method for solving two‐stage stochastic programming problems whose deterministic equivalents are represented by non‐convex mixed‐integer quadratically constrained quadratic programming (MIQCQP) models. The precision of the solution generated by the p‐branch‐and‐bound method can be arbitrarily adjusted by
Nikita Belyak, Fabricio Oliveira
wiley +1 more source
A QUBO Formulation for Multi‐Material Topology Optimization With Quantum Annealing
International Journal for Numerical Methods in Engineering, Volume 127, Issue 16, 30 August 2026.ABSTRACT Multi‐material topology optimization (MMTO) seeks the optimal distribution of multiple materials within a given design domain to maximize structural performance. However, due to the high complexity of the solution space, MMTO problems are often trapped in local optima. To address this issue, a quantum annealing‐based MMTO framework is proposed.
Kenshin Nakano +2 more
wiley +1 more source
f-Flip strategies for unconstrained binary quadratic programming [PDF]
, 2016 Unconstrained binary quadratic programming (UBQP) provides a unifying modeling and solution framework for solving a remarkable range of binary optimization problems, including many accompanied by constraints.
Glover, Fred +3 more
core +1 more source
Constrained Optimization Involving Expensive Function Evaluations: A Sequential Approach [PDF]
This paper presents a new sequential method for constrained non-linear optimization problems.The principal characteristics of these problems are very time consuming function evaluations and the absence of derivative information.
Brekelmans, R.C.M. +3 more
core
Efficient digital quadratic unconstrained binary optimization solvers for SAT problems [PDF]
Boolean 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 problems
Yosifov, Alexander +2 more
core +2 more sources
Quadratic Unconstrained Binary Optimization (QUBO) is a combinatorial optimization problem defined by an energy function that consists of a quadratic formula involving multiple binary variables.
Li, Xiaotian +5 more
core +1 more source
Quadratic unconstrained binary optimization problem
Tato diplomová práce se zabývá kvadratickým neomezeným binárním optimalizačním problémem (QUBO). Práce je rozdělena do tří hlavních částí. První část tvoří komplexní rešerše teoretických poznatků o formátu QUBO a současných metodách jeho řešení.
Miloševič, Filip
core
Quadratic Unconstrained Binary Optimization (QUBO) problems are central to combinatorial optimization but challenging due to their exponential solution space.
Aditya Ranjan +4 more
core +1 more source
Multivariate Nonnegative Quadratic Mappings [PDF]
In this paper we study several issues related to the characterization of speci c classes of multivariate quadratic mappings that are nonnegative over a given domain, with nonnegativity de ned by a pre-speci ed conic order.In particular, we consider the ...
Zhang, S., Sturm, J.F., Luo, Z-Q
core