Limite Superior para o Problema da Diversidade Máxima

  • Pablo Luiz B. Soares
  • Manoel Campêlo


We apply the t-linearization to the straightforward 0 1 quadratic model for the maximum diversity problem. We computationally compare the obtained model with two other linear formulations from the literature. Computational experiments show that the t-linearization generates, on average, fewer constraints than the formulations, in addition to achieving a tighter upper bound in all used instances. On the other hand, one of the formulations can be slightly faster in obtaining the bounds.

SOARES, Pablo Luiz B.; CAMPÊLO, Manoel. Limite Superior para o Problema da Diversidade Máxima. In: ENCONTRO DE TEORIA DA COMPUTAÇÃO (ETC), 3. , 2018, Natal. Anais [...]. Porto Alegre: Sociedade Brasileira de Computação, 2018 . ISSN 2595-6116. DOI: