activity
20192026
most citedEvolutionary Algorithms for the Chance-Constrained Knapsack Problem

4 citations · 7 across the 19 of their papers we have counts for

collaborators
Showing cs.ETShow all

1 paper · 1 filter

cs.ET2025

Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms

Shuaiqun Pan, Yash J. Patel, Aneta Neumann +3

Variational quantum algorithms, such as the Recursive Quantum Approximate Optimization Algorithm (RQAOA), have become increasingly popular, offering promising avenues for employing…