lsmear : a variable selection strategy for interval branch and bound solvers - École des Ponts ParisTech Access content directly
Journal Articles Journal of Global Optimization Year : 2017

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 estimate 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 isg tested on a set of well-known benchmark instances outperforming significantly the classical variable selection strategies

Dates and versions

hal-01586978 , version 1 (13-09-2017)

Identifiers

Cite

Ignacio Araya, Bertrand Neveu. lsmear : a variable selection strategy for interval branch and bound solvers. Journal of Global Optimization, 2017, Special Issue: GOW-2016, 71 (3), pp.483-500. ⟨10.1007/s10898-017-0569-y⟩. ⟨hal-01586978⟩
137 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More