Results 21 to 30 of about 18,556 (186)
HUBO formulations for solving the eigenvalue problem
Results in Control and Optimization, 2023 Solving the eigenvalue problem is particularly important in almost all fields of science and engineering. With the development of quantum computers, multiple algorithms have been proposed for this purpose.
Kyungtaek Jun, Hyunju Lee
doaj +1 more source
Exploiting Hardware and Software Advances for Quadratic Models of Wind Farm Layout Optimization
IEEE Access, 2022 A key aspect of the design of a wind farm is the wind farm layout optimization (WFLO) problem: given a wind farm site and information about the wind patterns, the problem is to decide the location of individual wind turbines to maximize energy production
Arik Senderovich +3 more
doaj +1 more source
Flight Gate Assignment with a Quantum Annealer [PDF]
, 2018 Optimal flight gate assignment is a highly relevant optimization problem from airport management. Among others, an important goal is the minimization of the total transit time of the passengers.
A Haghani +6 more
core +4 more sources
Robust optimisation of unconstrained binary quadratic problems
International Journal of Operational Research, 2019 In this paper we focus on the unconstrained binary quadratic optimization model, maximize x^t Qx, x binary, and consider the problem of identifying optimal solutions that are robust with respect to perturbations in the Q matrix.. We are motivated to find robust, or stable, solutions because of the uncertainty inherent in the big data origins of Q and ...
Mark W. Lewis +2 more
openaire +2 more sources
Variational quantum algorithm for unconstrained black box binary optimization: Application to feature selection [PDF]
Quantum, 2023 We introduce a variational quantum algorithm to solve unconstrained black box binary optimization problems, i.e., problems in which the objective function is given as black box.
Christa Zoufal +8 more
doaj +1 more source
A Multilevel Algorithm for Large Unconstrained Binary Quadratic Optimization [PDF]
, 2012 The unconstrained binary quadratic programming (UBQP) problem is a general NP-hard problem with various applications. In this paper, we present a multilevel algorithm designed to approximate large UBQP instances. The proposed multilevel algorithm is composed of a backbone-based coarsening phase, an asymmetric uncoarsening phase and a memetic refinement
Wang, Yang +3 more
openaire +2 more sources
On the Complexity of Local Search in Unconstrained Quadratic Binary Optimization [PDF]
SIAM Journal on Optimization, 2016 Minor update in 2016: simplified ...
openaire +2 more sources
Multiblock ADMM Heuristics for Mixed-Binary Optimization on Classical and Quantum Computers
IEEE Transactions on Quantum Engineering, 2020 Solving combinatorial optimization problems on current noisy quantum devices is currently being advocated for (and restricted to) binary polynomial optimization with equality constraints via quantum heuristic approaches.
Claudio Gambella, Andrea Simonetto
doaj +1 more source
Algorithms, 2023 Quadratic unconstrained binary optimization (QUBO) is a classic NP-hard problem with an enormous number of applications. Local search strategy (LSS) is one of the most fundamental algorithmic concepts and has been successfully applied to a wide range of ...
Bahram Alidaee, Haibo Wang, Lutfu S. Sua
doaj +1 more source
Solving the Traveling Salesman Problem on the D-Wave Quantum Computer
Frontiers in Physics, 2021 The traveling salesman problem is a well-known NP-hard problem in combinatorial optimization. This paper shows how to solve it on an Ising Hamiltonian based quantum annealer by casting it as a quadratic unconstrained binary optimization (QUBO) problem ...
Siddharth Jain
doaj +1 more source