Suchergebnisse - "quadratic unconstrained binary optimization"

Data structures for speeding up Tabu Search when solving sparse quadratic unconstrained binary optimization problems von Liang, Ricardo N., Anacleto, Eduardo A. J., Meneses, Cláudio N.

“… The quadratic unconstrained binary optimization (QUBO) problem belongs to the NP-hard complexity class of problems and has been the subject of intense research since the 1960s …”
Volltext

Quantum computing-enhanced large-scale residential electric vehicle charging management von Deng, Zhipeng, Li, Yuewei, Wang, Xuezheng, Jiang, Zixin, Dong, Bing

“… The optimal control problem aimed at minimizing daily electricity costs was formulated with EV charging and discharging actions subject to battery capacity and occupancy constraints …”
Volltext

Exploiting Hardware and Software Advances for Quadratic Models of Wind Farm Layout Optimization von Senderovich, Arik, Zhang, Jiachen, Cohen, Eldan, Beck, J. Christopher

“… , the problem is to decide the location of individual wind turbines to maximize energy production subject to proximity restrictions …”
Volltext

Multivehicle Task Assignment Based on Collaborative Neurodynamic Optimization With Discrete Hopfield Networks von Wang, Jiasen, Wang, Jun, Han, Qing-Long

“… ). The original combinatorial quadratic optimization problem for TA is reformulated as a quadratic unconstrained binary optimization (QUBO …”
Volltext

solQHealer: Quantum Procedures for Rendering Infeasible Solutions Feasible: A Proof of Concept with the Maximum Independent Set Problem and 3-SAT von Deleplanque, Samuel, Pérez Armas, Luis Fernando, Creemers, Stefan

“… Over the past decade, the usefulness of quantum annealing hardware for combinatorial optimization has been the subject of active debate …”
Volltext

Quantum Computing for Transport Network Optimization von Ju, Jiangwei, Liu, Zhihang, Bai, Yuelin, Wang, Yong, Gao, Qi, Ma, Yin, Zheng, Chao, Wen, Kai

“… Public transport systems play a crucial role in the development of large cities. Bus network design to optimize passenger flow coverage in a global metropolis …”
Volltext

Individual subject evaluated difficulty of adjustable mazes generated using quantum annealing von Ishikawa, Yuto, Yoshihara, Takuma, Okamura, Keita, Ohzeki, Masayuki

“… of a quadratic unconstrained binary optimization problem suitable for the input of the quantum annealer …”
Volltext

Ising Machine Approach to the Lecturer-Student Assignment Problem von Tomita, Sora, Shirai, Tatsuhiko, Togawa, Nozomu

“… Ising machines are efficient solvers for combinatorial optimization problems (COPs). After mapping COPs to Quadratic Unconstrained Binary Optimization …”
Volltext

Quantum-Enhanced Reinforcement Learning for Finite-Episode Games with Discrete State Spaces von Neukart, Florian, Von Dollen, David, Seidel, Christian, Compostella, Gabriele

“… ], have been subject to multiple analyses in research, with the aim of characterizing the technology's usefulness for optimization and sampling tasks [2–16 …”
Volltext

solQHealer: Quantum Procedures for Rendering Infeasible Solutions Feasible: A Proof of Concept with the Maximum Independent Set Problem and 3-SAT: solQHealer: Quantum Procedures for Rendering Infeasible von Deleplanque, Samuel, Pérez Armas, Luis Fernando, Creemers, Stefan

“… Over the past decade, the usefulness of quantum annealing hardware for combinatorial optimization has been the subject of active debate …”
Volltext

GPS: A New TSP Formulation for Its Generalizations Type QUBO von Gonzalez-Bermejo, Saul, Alonso-Linaje, Guillermo, Atchade-Adelomou, Parfait

“… We propose a new Quadratic Unconstrained Binary Optimization (QUBO) formulation of the Travelling Salesman Problem (TSP …”
Volltext

Qfold: a new modeling paradigm for the RNA folding problem von Lewis, Mark W., Verma, Amit, Eckdahl, Todd T.

“… Here we report on a Quadratic Unconstrained Binary Optimization (QUBO) modeling paradigm that fits naturally with the parameters and constraints required for RNA folding prediction …”
Volltext

Hybrid quantum-classical scheduling optimization in UAV-enabled IoT networks von Vista, Francesco, Iacovelli, Giovanni, Grieco, Luigi Alfredo

“… As a result, the original problem is mapped to quadratic unconstrained binary optimization form, in order to be processed by a quantum processing unit …”
Volltext

Quantum-Assisted Cluster Analysis on a Quantum Annealing Device von Neukart, Florian, Dollen, David Von, Seidel, Christian

“… We explain how the problem can be expressed as a quadratic unconstrained binary optimization problem and show that the introduced quantum-assisted clustering algorithm is, regarding accuracy …”
Volltext

An energy optimization method based on mixed-integer model and variational quantum computing algorithm for faster IMPT von Zhu, Ya-Nan, Shinde, Nimita, Lin, Bowen, Gao, Hao

“… Intensity-modulated proton therapy (IMPT) offers superior dose conformity with reduced exposure to surrounding healthy tissues compared to conventional photon …”
Volltext

Individual subject evaluated difficulty of adjustable mazes generated using quantum annealing von Ishikawa, Yuto, Yoshihara, Takuma, Okamura, Keita, Ohzeki, Masayuki

“… of a quadratic unconstrained binary optimization problem suitable for the input of the quantum annealer …”
Volltext

Using Quantum Computers to Study Random Close Packing of Granular Discs von Gazzillo, Zachary, Franklin, Scott, Alarcon, Sonia Lopez

“… We reformulate the problem of granular random close packing of 2D discs as a Quadratic Unconstrained Binary Optimization in order to utilize the D-Wave 2000Q quantum annealing computer …”
Volltext

Reducing quantum annealing biases for solving the graph partitioning problem von Pelofske, Elijah, Hahn, Georg, Djidjev, Hristo N

“… (quadratic unconstrained binary optimization) or an Ising form. This is done by mapping a problem onto the physical qubits and couplers of the quantum chip, from which a solution is read after a process called quantum annealing …”
Volltext

Curve fitting on a quantum annealer for an advanced navigation method von Isserstedt, Philipp, Jaroszewski, Daniel, Mergenthaler, Wolfgang, Felix, Paul, Harrach, Bastian

“… Although this task can be accomplished classically, it can also be formulated as a quadratic unconstrained binary optimization problem, which is suited to be solved with quantum annealing …”
Volltext

GPS: A new TSP formulation for its generalizations type QUBO von González-Bermejo, Saúl, Alonso-Linaje, Guillermo, Atchade-Adelomou, Parfait

“… We propose a new Quadratic Unconstrained Binary Optimization (QUBO) formulation of the Travelling Salesman Problem (TSP …”
Volltext