Using local optimization to early separate feasible solutions with a global branch-and-reduce-and-expand approach - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Using local optimization to early separate feasible solutions with a global branch-and-reduce-and-expand approach

Résumé

Branch-and-reduce algorithms aim at finding all the solutions of constraint satisfaction problems. They combine branching and reduction steps using e.g. interval methods. In this framework, we introduce expansion steps that calculate approximate solutions with a local optimization solver and find enclosing regions of the exact solutions in their neighborhoods. It may result in a better separation of the solutions early in the solving process, hence accelerating the convergence of the algorithm. We expect that such a local/global approach can benefit continuous global optimization.
Fichier non déposé

Dates et versions

hal-04337965 , version 1 (12-12-2023)

Identifiants

  • HAL Id : hal-04337965 , version 1

Citer

Raphaël Chenouard, Laurent Granvilliers. Using local optimization to early separate feasible solutions with a global branch-and-reduce-and-expand approach. 20th EUROpt Workshop, Aug 2023, Budapest, Hungary. ⟨hal-04337965⟩
9 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More