Výsledky vyhľadávania - "Constrained combinatorial optimization problem"

MEACCP: A membrane evolutionary algorithm for capacitated clustering problem Autor Liu, Yaoyao, Guo, Ping, Zeng, Yi

“…•A membrane evolution algorithm MEACCP is designed to solve the CCP.•The membranes structure and objects representation of MEACCP are designed.•The population…”
Získať plný text

Inductive Construction of Variational Quantum Circuit for Constrained Combinatorial Optimization Autor Nakada, Hyakka, Tanahashi, Kotaro, Tanaka, Shu

“…In this study, we propose a new method for constrained combinatorial optimization using variational quantum circuits. Quantum computers are considered to have…”
Získať plný text

Efficient Control Pulses for Continuous Quantum Gate Families Through Coordinated Re-Optimization Autor Chadwick, Jason D., Chong, Frederic T.

“…We present a general method to quickly generate high-fidelity control pulses for any continuously-parameterized set of quantum gates after calibrating a small…”
Získať plný text

Experimental Demonstration of Fermionic QAOA with One-Dimensional Cyclic Driver Hamiltonian Autor Yoshioka, Takuya, Sasada, Keita, Nakano, Yuichiro, Fujii, Keisuke

“…Quantum approximate optimization algorithm (QAOA) has attracted much attention as an algorithm that has the potential to efficiently solve combinatorial…”
Získať plný text

Performance analysis of the quantum alternating operator ansatz for solving the minimum weighted vertex cover problem Autor Li, Guang-Hui, Wang, Sha-Sha, Ni, Xiao-Hui, Gao, Fei, Guo, Fen-Zhuo, Qin, Su-Juan, Wen, Qiao-Yan

“…The Quantum Alternating Operator Ansatz (QAOA+) extends the Quantum Approximate Optimization Algorithm (QAOA) to solve constrained combinatorial optimization…”
Získať plný text

Quantum alternating operator ansatz for solving the minimum dominating set problem on sparse graphs with a specific structure Autor Li, Guanghui, Wang, Shasha, Zhao, Xiumei, Gao, Fei, Qin, Sujuan, Guo, Fenzhuo, Jin, Zhengping

“…The minimum dominating set (MDS) problem is a well-known NP-hard problem in graph theory. While several quantum algorithms have been proposed to address this…”
Získať plný text

A hybrid evolutionary approach for solving constrained optimization problems over finite domains Autor Ruiz-Andino, A., Araujo, L., Saenz, F., Ruz, J.

“…A novel approach for the integration of evolution programs and constraint-solving techniques over finite domains is presented. This integration provides a…”
Získať plný text