Author of the publication

An Effective Variable Neighborhood Search with Perturbation for Location-Routing Problem.

, , , and . Int. J. Artif. Intell. Tools, 28 (7): 1950024:1-1950024:17 (2019)

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.

 

Other publications of authors with the same name

U-Log = datalog + constraints., , and . JFPLC, page 369-372. (1995)Analysis and Generation of Pseudo-Industrial MaxSAT Instances., , , and . CCIA, volume 248 of Frontiers in Artificial Intelligence and Applications, page 173-184. IOS Press, (2012)Applying a unified object logic model to implement a strong and dynamic interface between Prolog and an OODBMS., and . BDA, page 280-. INRIA, (1992)New Inference Rules for Max-SAT, , and . CoRR, (2011)A Switching Criterion for Intensification and Diversification in Local Search for SAT., , and . J. Satisf. Boolean Model. Comput., 4 (2-4): 219-237 (2008)A Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers., , and . J. Autom. Reason., 34 (1): 73-101 (2005)Parallelizing Satz Using Dynamic Workload Balancing., , and . Electron. Notes Discret. Math., (2001)Look-Ahead Versus Look-Back for Satisfiability Problems., and . CP, volume 1330 of Lecture Notes in Computer Science, page 341-355. Springer, (1997)Exploiting Cycle Structures in Max-SAT., , , and . SAT, volume 5584 of Lecture Notes in Computer Science, page 467-480. Springer, (2009)Solving longest common subsequence problems via a transformation to the maximum clique problem., , , , , , and . Comput. Oper. Res., (2021)