Results 101 to 110 of about 22,651 (215)

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, Georgia Theocharopoulou, Sofia Fanarioti   +4 more
doaj   +1 more source

New Results on Closed-form Formulas for Evaluating r-flip Moves in Quadratic Unconstrained Binary Optimization

, 2022
Haibo Wang
openalex   +1 more source

Multi-Objective Portfolio Optimization Using a Quantum Annealer

Mathematics
In this study, the portfolio optimization problem is explored, using a combination of classical and quantum computing techniques. The portfolio optimization problem with specific objectives or constraints is often a quadratic optimization problem, due to
Esteban Aguilera, Jins de Jong, Frank Phillipson, Skander Taamallah, Mischa Vos   +4 more
doaj   +1 more source

Energy landscape structure of small graph isomorphism under variational optimization [PDF]

AIP Advances
We investigate a quadratic unconstrained binary optimization formulation of the graph isomorphism problem using the quantum approximate optimization algorithm and the variational quantum eigensolver.
Turbasu Chatterjee, Shah Ishmam Mohtashim, Akash Kundu   +2 more
doaj   +1 more source

A Comparative Study on Solving Optimization Problems With Exponentially Fewer Qubits

IEEE Transactions on Quantum Engineering
Variational quantum optimization algorithms, such as the variational quantum eigensolver (VQE) or the quantum approximate optimization algorithm (QAOA), are among the most studied quantum algorithms.
David Winderl, Nicola Franco, Jeanette Miriam Lorenz   +2 more
doaj   +1 more source

Problem-structure-informed quantum approximate optimization for large-scale unit commitment with limited qubits

iEnergy
As power systems expand, solving the unit commitment problem (UCP) becomes increasingly challenging due to the curse of dimensionality, and traditional methods often struggle to balance computational efficiency and solution optimality.
Jingxian Zhou, Ziqing Zhu, Linghua Zhu, Siqi Bu   +3 more
doaj   +1 more source

Quadratic and Higher-Order Unconstrained Binary Optimization of Railway Rescheduling for Quantum Computing [PDF]

, 2021
Krzysztof Domino, Akash Kundu, Özlem Salehi, Krzysztof Krawiec   +3 more
openalex   +1 more source

Quadratic and Higher-Order Unconstrained Binary Optimization of Railway Dispatching Problem for Quantum Computing [PDF]

, 2021
Krzysztof Domino, Akash Kundu, Özlem Salehi, Krzysztof Krawiec   +3 more
openalex  

Optimizing Heat Treatment Schedules via QUBO Formulation

Applied Sciences
Quadratic Unconstrained Binary Optimization (QUBO) is the problem of finding binary variable assignments that minimize a given quadratic objective function.
Ikuto Nakatsukasa, Koji Nakano, Victor Parque, Yasuaki Ito   +3 more
doaj   +1 more source

Construction of SubQUBOs by K-Means Clustering of QUBO Variables

IEEE Access
Ising machines are specialized solvers for combinatorial optimization problems (COPs), which are typically formulated as quadratic unconstrained binary optimization (QUBO) models.
Yuko Kamishima, Shuta Kikuchi, Shu Tanaka   +2 more
doaj   +1 more source