Quantum annealing combined with weighted objectives and problem decomposition finds competitive non-dominated solutions to next-release and feature-selection problems faster than NSGA-II in most tested cases.
In: The 2nd International Conference on Software Engineering and Data Mining, pp
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
other 1
citation-polarity summary
fields
cs.SE 1years
2025 1verdicts
CONDITIONAL 1roles
other 1polarities
unclear 1representative citing papers
citing papers explorer
-
A Quantum Annealing Approach for Solving Optimal Feature Selection and Next Release Problems
Quantum annealing combined with weighted objectives and problem decomposition finds competitive non-dominated solutions to next-release and feature-selection problems faster than NSGA-II in most tested cases.