A strengthened model for the web search optimization problem

In this article we investigate the Web Search Optimization Problem, a NP-hard combinatorial optimization problem arising from Software Design. This is a new problem in the combinatorial optimization area. We develop a natural mixed integer linear programming formulation for this problem. The natural model is strengthened by including in the model valid inequalities. Computational experiments show that, in most cases, the strengthened model gives an integer solution for the problem. The lower bounds obtained by the strengthened model relaxation of the considered formulation improve upon those obtained by the natural model relaxation.