Revisiting the upper bounding process in a safe Branch and Bound algorithm - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Revisiting the upper bounding process in a safe Branch and Bound algorithm

Résumé

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 strategy to compute very accurate approximations of feasible points. This strategy takes advantage of the Newton method for under-constrained systems of equations and inequalities. More precisely, it exploits the optimal solution of a linear relaxation of the problem to compute efficiently a promising upper bound. First experiments on the Coconuts benchmarks demonstrate that this approach is very effective.
Fichier principal
Vignette du fichier
cp08_short.pdf (153.62 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00297086 , version 1 (15-07-2008)

Identifiants

Citer

Alexandre Goldsztejn, Yahia Lebbah, Claude Michel, Michel Rueher. Revisiting the upper bounding process in a safe Branch and Bound algorithm. 14th International Conference on Principles and Practice of Constraint Programming, Sep 2008, Sydney, Australia. pp.598-602. ⟨hal-00297086⟩
154 Consultations
137 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More