Results 1 to 10 of about 2,283 (206)
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 ...
Parfait Atchade-Adelomou
exaly +4 more sources
Optimizing Heat Treatment Schedules via QUBO Formulation
Applied Sciences (Switzerland)Quadratic Unconstrained Binary Optimization (QUBO) is the problem of finding binary variable assignments that minimize a given quadratic objective function.
Victor Parque, Koji Nakano, Yasuaki Itô
exaly +4 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 +2 more
exaly +4 more sources
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
exaly +3 more sources
Application of QUBO solver using black-box optimization to structural design for resonance avoidance [PDF]
Scientific Reports, 2022 Quadratic unconstrained binary optimization (QUBO) solvers can be applied to design an optimal structure to avoid resonance. QUBO algorithms that work on a classical or quantum device have succeeded in some industrial applications.
Tadayoshi Matsumori +2 more
doaj +2 more sources
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 +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 +2 more
doaj +1 more source
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 +1 more source
Cinco cosas que le pido al BIM, una reflexión profesional y docente
Revista de Expresión Gráfica en la Edificación, 2016 La forma en que se generaba documentación gráfica para la construcción de edificios no volvió a ser la misma desde la introducción del CAD -Computer Aided Design /Diseño Asistido por Ordenador hace más de tres décadas. Ahora, con la inminente/inexcusable
David Valverde Cantero +1 more
doaj +1 more source