Empirical convergence speed of inclusion functions for facility location problems

B. Tóth, J. Fernández, T. Csendes

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

One of the key points in interval global optimization is the selection of a suitable inclusion function which allows to solve the problem efficiently. Usually, the tighter the inclusions provided by the inclusion function, the better, because this will make the accelerating devices used in the algorithm more effective at discarding boxes. On the other hand, whereas more sophisticated inclusion functions may give tighter inclusions, they require more computational effort than others providing larger overestimations. In an earlier paper, the empirical convergence speed of inclusion functions was defined and studied, and it was shown to be a good indicator of the inclusion precision. If the empirical convergence speed is analyzed for a given type of functions, then one can select the appropriate inclusion function to be used when dealing with those type of functions. In this paper we present such a study, dealing with functions used in competitive facility location problems.

Original languageEnglish
Pages (from-to)384-389
Number of pages6
JournalJournal of Computational and Applied Mathematics
Volume199
Issue number2
DOIs
Publication statusPublished - Feb 15 2007

Keywords

  • Convergence speed
  • Facility location
  • Inclusion function

ASJC Scopus subject areas

  • Computational Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Empirical convergence speed of inclusion functions for facility location problems'. Together they form a unique fingerprint.

  • Cite this