Results 1 to 10 of about 3,153 (133)

GPS: A New TSP Formulation for Its Generalizations Type QUBO

Mathematics, 2022
We propose a new Quadratic Unconstrained Binary Optimization (QUBO) formulation of the Travelling Salesman Problem (TSP), with which we overcame the best formulation of the Vehicle Routing Problem (VRP) in terms of the minimum number of necessary ...
Saul Gonzalez-Bermejo, Guillermo Alonso-Linaje, Parfait Atchade-Adelomou   +2 more
exaly   +3 more sources

Quantum annealing for inverse kinematics in robotics [PDF]

Scientific Reports
We study a proof-of-concept workflow that reformulates planar inverse kinematics (IK) for robotic manipulators as a Quadratic Unconstrained Binary Optimization (QUBO) using a linear binary discretization of joint angles and one-hot (big-M) constraints ...
Hadi Salloum, Sergei Savin, Yaroslav Kholodov, Gleb Ryzhakov, Mirko Farina, Ivan Oseledets   +5 more
doaj   +2 more sources

A QUBO Model for the Traveling Salesman Problem with Time Windows

Algorithms, 2019
This work focuses on expressing the TSP with Time Windows (TSPTW for short) as a quadratic unconstrained binary optimization (QUBO) problem. The time windows impose time constraints that a feasible solution must satisfy. These take the form of inequality
Christos Papalitsas, Theodore Andronikos, Konstantinos Giannakis   +2 more
exaly   +3 more sources

Constructing the Neighborhood Structure of VNS Based on Binomial Distribution for Solving QUBO Problems

Algorithms, 2022
The quadratic unconstrained binary optimization (QUBO) problem is categorized as an NP-hard combinatorial optimization problem. The variable neighborhood search (VNS) algorithm is one of the leading algorithms used to solve QUBO problems. As neighborhood
Dhidhi Pambudi, Masaki Kawamura
exaly   +3 more sources

Range dependent Hamiltonian algorithms for numerical QUBO formulation [PDF]

Scientific Reports
With the advent and development of quantum computers, various quantum algorithms that can solve linear equations and eigenvalues faster than classical computers have been developed.
Hyunju Lee, Kyungtaek Jun
doaj   +2 more sources

Quadratic unconstrained binary optimization and constraint programming approaches for lattice-based cyclic peptide docking [PDF]

Scientific Reports
The peptide-protein docking problem is an important problem in structural biology that facilitates rational and efficient drug design. In this work, we explore modeling and solving this problem with the quantum-amenable quadratic unconstrained binary ...
J. Kyle Brubaker, Kyle E. C. Booth, Akihiko Arakawa, Fabian Furrer, Jayeeta Ghosh, Tsutomu Sato, Helmut G. Katzgraber   +6 more
doaj   +2 more sources

Ferroelectric compute-in-memory annealer for combinatorial optimization problems [PDF]

Nature Communications
Computationally hard combinatorial optimization problems (COPs) are ubiquitous in many applications. Various digital annealers, dynamical Ising machines, and quantum/photonic systems have been developed for solving COPs, but they still suffer from the ...
Xunzhao Yin, Yu Qian, Alptekin Vardar, Marcel Günther, Franz Müller, Nellie Laleni, Zijian Zhao, Zhouhang Jiang, Zhiguo Shi, Yiyu Shi, Xiao Gong, Cheng Zhuo, Thomas Kämpfe, Kai Ni   +13 more
doaj   +2 more sources

Classifying and Benchmarking Quantum Annealing Algorithms Based on Quadratic Unconstrained Binary Optimization for Solving NP-Hard Problems

IEEE Access, 2023
Quantum annealing has the potential to outperform classical transistor-based computer technologies in tackling intricate combinatorial optimization problems. However, ongoing scientific debates cast doubts on whether quantum annealing devices (or quantum
Jehn-Ruey Jiang, Chun-Wei Chu
doaj   +1 more source

Searching for an Efficient System of Equations Defining the AES Sbox for the QUBO Problem

Journal of Telecommunications and Information Technology, 2023
The time complexity of solving the QUBO problem depends mainly on the number of logical variables in the problem. This paper focuses mainly on finding a system of equations that uniquely defines the Sbox of the AES cipher and simultaneously allows us to
Elżbieta Burek, Krzysztof Mańk, Michał Wroński   +2 more
doaj   +1 more source

Quadratic Unconstrained Binary Optimization for the Automotive Paint Shop Problem

IEEE Access, 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 ...
Pieter Debevere, Masahiko Sugimura, Matthieu Parizy   +2 more
doaj   +1 more source