In this report, we will introduce the complexity analysis of the Next Release Problem (NRP) backbone. This report is the supplement material for the paper about the Backbone based Multilevel Algorithm (BMA) for the Next Release Problem (NRP) [2]. The NRP is a combinatorial optimization problem in search based requirements engineering. Th
This is supplementary material for the paper ``Structurally Restricted Fragments of Numeric Planning...
Much of the research progress that is achieved nowadays in various scientific fields has its origin ...
Metaheuristics are a family of algorithmic techniques that are useful for solving difficult problems...
The next release problem (NRP) aims to effectively select software requirements in order to acquire ...
<p>Jifeng Xuan, He Jiang, Zhilei Ren, Zhongxuan Luo, “Solving the Large Scale Next Release Problem w...
This book provides a roadmap for readers to determine the difficulty of an algorithmic problem by fi...
This paper is concerned with the multi-Objective Next Release Problem (MONRP), a problem in search-b...
This paper approaches computational complexity as the determination of the intrinsic difficulty of m...
ABSTRACT In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem an...
An approach to problem analysis is described, based on the notion of a problem frame. Problem frames...
Brüggemann W, Fischer K, Jahnke H. Problems, Models and Complexity. Part II: Application to the DLSP...
AbstractMulti-objectiveOptimization Problems (MOPs) are commonly encountered in the study and design...
International Journal of Combinatorial Optimization Problems and Informatics, vol. 2, núm. 2, mayo
We survey a number of recent results that relate the fine-grained complexity of several NP-Hard prob...
We explain the essence of K. Mulmuley and M. Sohoni, \Geometric Complexity Theory I: An Approach to ...
This is supplementary material for the paper ``Structurally Restricted Fragments of Numeric Planning...
Much of the research progress that is achieved nowadays in various scientific fields has its origin ...
Metaheuristics are a family of algorithmic techniques that are useful for solving difficult problems...
The next release problem (NRP) aims to effectively select software requirements in order to acquire ...
<p>Jifeng Xuan, He Jiang, Zhilei Ren, Zhongxuan Luo, “Solving the Large Scale Next Release Problem w...
This book provides a roadmap for readers to determine the difficulty of an algorithmic problem by fi...
This paper is concerned with the multi-Objective Next Release Problem (MONRP), a problem in search-b...
This paper approaches computational complexity as the determination of the intrinsic difficulty of m...
ABSTRACT In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem an...
An approach to problem analysis is described, based on the notion of a problem frame. Problem frames...
Brüggemann W, Fischer K, Jahnke H. Problems, Models and Complexity. Part II: Application to the DLSP...
AbstractMulti-objectiveOptimization Problems (MOPs) are commonly encountered in the study and design...
International Journal of Combinatorial Optimization Problems and Informatics, vol. 2, núm. 2, mayo
We survey a number of recent results that relate the fine-grained complexity of several NP-Hard prob...
We explain the essence of K. Mulmuley and M. Sohoni, \Geometric Complexity Theory I: An Approach to ...
This is supplementary material for the paper ``Structurally Restricted Fragments of Numeric Planning...
Much of the research progress that is achieved nowadays in various scientific fields has its origin ...
Metaheuristics are a family of algorithmic techniques that are useful for solving difficult problems...
View in ORKG