Abstract
The Next Release Problem (nrp) is an important problem in Software Engineering. Several papers investigate the nrp, most of them considering heuristics to solve the problem. However, the literature lacks a more theoretical approach to this problem, specially regarding its complexity, approximability and more powerful exact algorithms. In this paper we aim to help filling this gap.
B. Piva—The authors would like to thank PIBIC/UFS for the support.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bagnall, A.J., Rayward-Smith, V.J., Whittley, I.M.: The next release problem. Inf. Softw. Technol. 43(14), 883–890 (2001)
Baker, P., Harman, M., Steinhofel, K., Skaliotis, A.: Search based approaches to component selection and prioritization for the next release problem. In: 2006 22nd IEEE International Conference on Software Maintenance, pp. 176–185, September 2006
Botelho, G., Rocha, A., Britto, A., Silva, L.: Investigating bioinspired strategies to solve large scale next release problem. In: SET 15 in CIbSE 2015 - Ibero American Conference on Software Engineering (2015)
Freitas, F.G., Coutinho, D.P., Souza, J.T.: Software next release planning approach through exact optimization. Int. J. Comput. Appl. 22(8), 1–8 (2011)
Freitas, F., Silva, T., Carmo, R., Souza, J.: On the applicability of exact optimization in search based software engineering. In: Cohen, M.B., Ó Cinnéide, M. (eds.) SSBSE 2011. LNCS, vol. 6956, p. 276. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-23716-4_29
Harman, M.: Search based software engineering. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2006. LNCS, vol. 3994, pp. 740–747. Springer, Heidelberg (2006). https://doi.org/10.1007/11758549_100
Jiang, H., Zhang, J., Xuan, J., Ren, Z., Hu, Y.: A hybrid ACO algorithm for the next release problem. CoRR, abs/1704.04777 (2017)
van den Akker, M., Brinkkemper, S., Diepen, G., Versendaal, J.: Flexible release composition using integer linear programming. Technical report UU-CS-2004-063, Institute of Information and Computing Sciences, Utrecht University, December 2004. In English, 16 pages
Veerapen, N., Ochoa, G., Harman, M., Burke, E.K.: An integer linear programming approach to the single and bi-objective next release problem. Inf. Softw. Technol. 65(Supplement C), 1–13 (2015)
Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms, 1st edn. Cambridge University Press, New York (2011)
Wolsey, L.A.: Integer Programming. Wiley, New York (1998)
Xuan, J., Jiang, H., Ren, Z., Luo, Z.: Solving the large scale next release problem with a backbone-based multilevel algorithm. IEEE Trans. Softw. Eng. 38(5), 1195–1212 (2012)
Zhang, Y., Harman, M., Mansouri, A.: The SBSE repository: a repository and analysis of authors and research articles on search based software engineering. http://crestweb.cs.ucl.ac.uk/resources/sbse_repository/
Zhang, Y., Harman, M., Mansouri, A.S.: The multi-objective next release problem. In: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, GECCO 2007, New York, NY, USA, pp. 1129–1137. ACM (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Almeida, J.C., Pereira, F.d.C., Reis, M.V.A., Piva, B. (2018). The Next Release Problem: Complexity, Exact Algorithms and Computations. In: Lee, J., Rinaldi, G., Mahjoub, A. (eds) Combinatorial Optimization. ISCO 2018. Lecture Notes in Computer Science(), vol 10856. Springer, Cham. https://doi.org/10.1007/978-3-319-96151-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-96151-4_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-96150-7
Online ISBN: 978-3-319-96151-4
eBook Packages: Computer ScienceComputer Science (R0)