Deriving filtering algorithms from dedicated algorithms: zoom on the Bin Packing problem - IMT Mines Albi-Carmaux Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Deriving filtering algorithms from dedicated algorithms: zoom on the Bin Packing problem

Résumé

Solving NP-complete problems can be tough because of the combinatorics. Constraint Programming and Approximation algorithms can be used to solve these problems. In this paper, we explore how to automatically derive filtering algorithms from a dedicated algorithm solving the Bin Packing problem. To this end, we automatically derive a filtering algorithm from the Best-Fit algorithm. We empirically show that our filtering algorithm BF-Prop is experimentally strictly more efficient in terms of filtering than Shaw’s state-of-the-art global constraint.
Fichier non déposé

Dates et versions

hal-01923740 , version 1 (15-11-2018)

Identifiants

  • HAL Id : hal-01923740 , version 1

Citer

Arthur Godet, Xavier Lorca, Gilles Simonin. Deriving filtering algorithms from dedicated algorithms: zoom on the Bin Packing problem. CP 2018 - The 24th International Conference on Principles and Practice of Constraints Programming : Doctoral Program Proceedings, Aug 2018, Lille, France. 9 p. ⟨hal-01923740⟩
161 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More