( en | de | ru )

 

Disambiguation of "Bennaceur, Hachemi"

Author of the publication

copydeleteadd this publication to your clipboard
An Incremental Branch-and-Bound Method for the Satisfiability Problem.

, , and . INFORMS J. Comput., 10 (3): 301-308 (1998)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Hachemi Guendoul

Amel Bennaceur

Hachemi Guendoul

Hachemi BenFtima

Mahmoud Hachemi Dezfouli

 

Other publications of authors with the same name

Clique inference process for solving Max-CSP., and . Eur. J. Oper. Res., 199 (3): 665-673 (2009)A Comparison between SAT and CSP Techniques.. Constraints An Int. J., 9 (2): 123-138 (2004)Boolean approch for representing and solving constraint-satisfaction problems.. AI*IA, volume 992 of Lecture Notes in Computer Science, page 163-174. Springer, (1995)smartPATH: A hybrid ACO-GA algorithm for robot path planning., , , , and . IEEE Congress on Evolutionary Computation, page 1-8. IEEE, (2012)COROS: A Multi-Agent Software Architecture for Cooperative and Autonomous Service Robots., , , , , , , , and . Advances in Social Media Analysis, volume 604 of Studies in Computational Intelligence, Springer, (2015)A Weighted Arc Consistency Technique for MAX-CSP., and . ECAI, page 209-213. John Wiley and Sons, (1998)Clique Inference Process for Solving Max-CSP., and . CP, volume 4204 of Lecture Notes in Computer Science, page 746-750. Springer, (2006)Valid Inequality Based Lower Bounds for WCSP., and . CP, volume 4741 of Lecture Notes in Computer Science, page 394-408. Springer, (2007)An Exact Algorithm for the Constraint Satisfaction Problem: Application to Logical Inference., and . Inf. Process. Lett., 48 (3): 151-158 (1993)Genetic Algorithm For The Travelling Salesman Problem using Enhanced Sequential Constructive Crossover Operator, and . International Journal of Computer Science and Security (IJCSS), 11 (3): 42-52 (June 2017)