Results 1 to 10 of about 2,742,325 (160)
A smaller and more efficient one-hot encoding for QUBO [PDF]
Scientific ReportsOne-hot constraints are widely used for quadratic unconstrained binary optimization (QUBO) in quantum and simulated annealing to solve optimization problems. They correspond to exactly-one constraints for Boolean satisfiability problems (SAT), which have
Shinji Takasugi +3 more
doaj +2 more sources
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 +2 more
doaj +2 more sources
Goal seeking Quadratic Unconstrained Binary Optimization
Results in Control and Optimization, 2022 The Quadratic Unconstrained Binary Optimization (QUBO) modeling and solution framework is a requirement for quantum and digital annealers. However optimality for QUBO problems of any practical size is extremely difficult to achieve.
Amit Verma, Mark Lewis
doaj +3 more sources
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 +2 more
doaj +2 more sources
Quantum annealing for inverse kinematics in robotics [PDF]
Scientific ReportsWe 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 +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 +4 more
doaj +2 more sources
Optimizing Heat Treatment Schedules via QUBO Formulation
Applied SciencesQuadratic Unconstrained Binary Optimization (QUBO) is the problem of finding binary variable assignments that minimize a given quadratic objective function.
Ikuto Nakatsukasa +3 more
doaj +2 more sources
Toward Solution‐Time Advantage With Error‐Mitigated Quantum Annealing for Combinatorial Optimization
Advanced Physics ResearchQuantum annealing (QA) has the potential to solve complex optimization problems, but its broad adoption is hindered by qubit errors, which cause an exponential slowdown in computing the global optimal solution as problem size increases.
Yushuang Sam Yang +3 more
doaj +2 more sources
Quantum ReportsThe optimization of investment portfolios represents a pivotal task within the field of financial economics. Its objective is to identify asset combinations that meet specified criteria for return and risk.
Mirko Mattesi +6 more
doaj +2 more sources
RisksIn this paper, we consider the inclusion of the solvency capital requirement (SCR) into portfolio optimization by the use of a quadratic proxy model. The Solvency II directive requires insurance companies to calculate their SCR based on the complete loss
Ivica Turkalj +8 more
doaj +2 more sources