Results 11 to 20 of about 2,595,187 (128)
On the hardness of quadratic unconstrained binary optimization problems [PDF]
, 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.
Michielsen, K. +8 more
core +3 more sources
Modifications of the Limited Memory BFGS Algorithm for Large-scale Nonlinear Optimization [PDF]
, 2005 In this paper we present two new numerical methods for unconstrained large-scale optimization. These methods apply update formulae, which are derived by considering different techniques of approximating the objective function.
June, Leong Wah, Hassan, Malik Abu
core +1 more source
QUBO.jl: A Julia Ecosystem for Quadratic Unconstrained Binary Optimization [PDF]
, 2023 We present QUBO.jl, an end-to-end Julia package for working with QUBO (Quadratic Unconstrained Binary Optimization) instances. This tool aims to convert a broad range of JuMP problems for straightforward application in many physics and physics-inspired ...
Andrade, Tiago +5 more
core +1 more source
, 2023 The instances and codes used in the study titled "Routing and Wavelength Assignment with Protection: A Quadratic Unconstrained Binary Optimization Approach Enabled by Digital Annealer ...
Şeker, Oylum +2 more
core +1 more source
A continuous reformulation of the quadratic unconstrained binary optimization problem [PDF]
, 2015 In this paper we consider the Quadratic Unconstrained Binary Optimization (QUBO) Problem. Using a suitable function and penalty parameter we can reformulate the original QUBO problem as a continuous program. It is shown that the problem of large size can
ZAPOROJAN, Sergiu, MORARU, Vasile
core +1 more source
Binary Unconstrained Quadratic Optimization Problem
, 2013 In recent years the unconstrained quadratic binary program (UQP) has emerged as a unified framework for modeling and solving a wide variety of combinatorial optimization problems.
Gary A. Kochenberger +5 more
core +1 more source
Quantum Approximate Optimization Algorithm (QAOA) is one of the most short-term promising quantum-classical algorithm to solve unconstrained combinatorial optimization problems.
Lavignac, Marion +3 more
core +6 more sources
JayaX: Jaya algorithm with xor operator for binary optimization
, 2019 Jaya is a population-based heuristic optimization algorithm proposed for solving constrained and unconstrained optimization problems. The peculiar distinct feature of Jaya from the other population-based algorithms is that it updates the positions of ...
Aslan, Murat +2 more
core +1 more source
Quadratic Unconstrained Binary Optimization for the Automotive Paint Shop Problem
, 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 ...
Masahiko Sugimura +2 more
core +1 more source
Binary positive semidefinite matrices and associated integer polytopes [PDF]
, 2012 We consider the positive semidefinite (psd) matrices with binary entries, along with the corresponding integer polytopes.We begin by establishing some basic properties of these matrices and polytopes.
Sorensen, M M, Letchford, A N
core +4 more sources