lsmear: A Variable Selection Strategy for Interval Branch and Bound Solvers - École des Ponts ParisTech Access content directly
Conference Papers Year : 2016

lsmear: A Variable Selection Strategy for Interval Branch and Bound Solvers

Abstract

Smear-based variable selection strategies are well-known and commonly used by branch-and-prune interval-based solvers. They estimates the impact of the variables on each constraint of the system by using the partial derivatives and the sizes of the variable domains. Then they aggregate these values, in some way, to estimate the impact of each variable on the whole system. The variable with the greatest impact is then selected. A problem of these strategies is that they, generally, consider all constraints equally important. In this work, we propose a new variable selection strategy which first weights the constraints by using the optimal Lagrangian multipliers of a linearization of the original problem. Then, the impact of the variables is computed with a typical smear-based function but taking into account the weights of the constraints. The strategy is tested on classical benchmark instances outperforming significantly the classical ones.
Fichier principal
Vignette du fichier
lsmear-GOW-16.pdf (230.24 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01376611 , version 1 (05-10-2016)

Identifiers

  • HAL Id : hal-01376611 , version 1

Cite

Ignacio Araya, Bertrand Neveu. lsmear: A Variable Selection Strategy for Interval Branch and Bound Solvers. GOW'16 XIII Global Optimization Workshop, Sep 2016, Braga, Portugal. ⟨hal-01376611⟩
174 View
611 Download

Share

Gmail Mastodon Facebook X LinkedIn More