Article ID Journal Published Year Pages File Type
6948237 Information and Software Technology 2015 13 Pages PDF
Abstract
This study suggests that (1) approximation algorithms can be discarded in favor of the exact method for the single-objective instances and small bi-objective instances, (2) the Integer Linear Programming-based approximate algorithm outperforms the NSGA-II genetic approach on large bi-objective instances, and (3) the run times for both methods are low enough to be used in real-world situations.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Human-Computer Interaction
Preview
An Integer Linear Programming approach to the single and bi-objective Next Release Problem
Authors
, , , ,