A QAOA variant with a linear penalty for knapsack-style battery scheduling achieves roughly 95 percent of optimal revenue at shallow circuit depth in small simulated instances.
Lecture on Approximations Algorithms
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.ET 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Knapsack Problem variants of QAOA for battery revenue optimisation
A QAOA variant with a linear penalty for knapsack-style battery scheduling achieves roughly 95 percent of optimal revenue at shallow circuit depth in small simulated instances.