5 citations · 8 across the 7 of their papers we have counts for
1 paper · 1 filter
Alexandre Goldsztejn, Yahia Lebbah, Claude Michel +1
Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce a new str…