Section: Application Domains

Academic Benchmark Problems

• $\rho MNK$-landscapes [34] constitute a problem-independent model used for constructing multiobjective multimodal landscapes with objective correlation. They extend single-objective NK-landscapes  [90] and multiobjective NK-landscapes with independent objective functions  [85] . The four parameters defining a $\rho MNK$-landscape are: ($i$) the size of (binary string) solutions $N$, ($ii$) the variable correlation $K<N$, ($iii$) the number of objective functions $M$, and ($iv$) the correlation coefficient $\rho$. A number of problem instances and an instance generator are available at the following URL: http://mocobench.sf.net/ .

• The Unconstrained Binary Quadratic Programming (UBQP) problem is known to be a unified modeling and solution framework for many combinatorial optimization problems [91] . Given a collection of $n$ items such that each pair of items is associated with a profit value that can be positive, negative or zero, UBQP seeks a subset of items that maximizes the sum of their paired values. In [29] , we proposed an extension of the single-objective UBQP to the multiobjective case (mUBQP), where multiple objectives are to be optimized simultaneously. We showed that the mUBQP problem is both NP-hard and intractable. Some problem instances with different characteristics and an instance generator are also available at the following URL: http://mocobench.sf.net/ .