Results 41 to 50 of about 3,870 (235)
A New Spectral Conjugate Gradient method for solving unconstrained Optimization problems [PDF]
The spectral conjugate gradient methods are fascinating, and it has been shown that they are useful for strictly convex quadratic reduction when used properly.
أسامة محمد طاهر ویس +2 more
doaj +1 more source
A Multilevel Algorithm for Large Unconstrained Binary Quadratic Optimization [PDF]
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
Yang Wang 0030 +3 more
openaire +2 more sources
A METHOD FOR SOLVING THE PROCUREMENT OPTIMIZATION PROBLEM BASED ON INVERSE CALCULATIONS [PDF]
The paper describes a method for solving the procurement optimization problem based on inverse calculations. The method involves solving the unconstrained optimization problem and adjusting the obtained values of arguments subject to the constraint ...
Ekaterina Gribanova
doaj +1 more source
Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer
The Fujitsu Digital Annealer is designed to solve fully connected quadratic unconstrained binary optimization (QUBO) problems. It is implemented on application-specific CMOS hardware and currently solves problems of up to 1,024 variables.
Maliheh Aramon +7 more
doaj +1 more source
Solving the Traveling Salesman Problem on the D-Wave Quantum Computer
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
Power Network Optimization: A Quantum Approach
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
Multi-Objective Optimization Technique Based on QUBO and an Ising Machine
With an increase in the complexity of society, solving multi-objective optimization problems (MOPs) has become crucial. In this study, we introduced a novel method called “quadratic unconstrained binary optimization based on the weighted normal ...
Hiroshi Ikeda, Takashi Yamazaki
doaj +1 more source
Qubit Reduction and Quantum Speedup for Wireless Channel Assignment Problem
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
Ising machines, including quantum annealing machines, are promising next-generation computers for combinatorial optimization problems. However, due to hardware limitations, most Ising-type hardware can only solve objective functions expressed in linear ...
Kazuki Ikeuchi +2 more
doaj +1 more source
Intrinsic Phonons as a Dynamic Control Knob for Catalytic Reactivity in 2D Materials
Intrinsic phonon excitations are demonstrated to serve as a dynamic control knob for catalytic reactivity in 2D materials. Mode‐selective lattice vibrations reconstruct the electronic structure, lower oxygen evolution reaction barriers, establishing a phonon‐engineering paradigm for dynamically regulating electrocatalysis beyond conventional static ...
Kai Ren +5 more
wiley +1 more source

