### Abstract

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.

Original language | English |
---|---|

Pages (from-to) | 143-148 |

Number of pages | 6 |

Journal | WSEAS Transactions on Mathematics |

Volume | 18 |

Publication status | Published - 1 Jan 2019 |

### Fingerprint

### Keywords

- Natural Strengthened Formulation
- Valid Inequalities
- Web Search Optimization

### Cite this

}

*WSEAS Transactions on Mathematics*, vol. 18, pp. 143-148.

**A strengthened model for the web search optimization problem.** / Gonçalves, Graça Marques; Lourenço, Lídia Lampreia.

Research output: Contribution to journal › Article

TY - JOUR

T1 - A strengthened model for the web search optimization problem

AU - Gonçalves, Graça Marques

AU - Lourenço, Lídia Lampreia

N1 - UID/MAT/00297/2019#

PY - 2019/1/1

Y1 - 2019/1/1

N2 - 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.

AB - 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.

KW - Natural Strengthened Formulation

KW - Valid Inequalities

KW - Web Search Optimization

UR - http://www.scopus.com/inward/record.url?scp=85067346285&partnerID=8YFLogxK

M3 - Article

VL - 18

SP - 143

EP - 148

JO - WSEAS Transactions on Mathematics

JF - WSEAS Transactions on Mathematics

SN - 1109-2769

ER -