Local search with constraint propagation and conflict-based heuristics

Author:

Jussien Narendra,Lhomme Olivier

Publisher

Elsevier BV

Subject

Artificial Intelligence,Linguistics and Language,Language and Linguistics

Reference54 articles.

1. A tabu search algorithm for the open shop problem;Alcaide;TOP (Trabajos de Investigación Operativa),1997

2. A computational study of the job-shop scheduling problem;Applegate;ORSA J. Comput.,1991

3. A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem;Bayardo,1996

4. Using CSP look-back techniques to solve exceptionally hard SAT instances;Bayardo,1996

5. Arc consistency in dynamic constraint satisfaction problems;Bessière,1991

Cited by 83 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Discrete Mother Tree Optimization and Swarm Intelligence for Constraint Satisfaction Problems;Proceedings of the 14th International Conference on Agents and Artificial Intelligence;2022

2. A General Framework Based on Machine Learning for Algorithm Selection in Constraint Satisfaction Problems;Applied Sciences;2021-03-18

3. Four decades of research on the open-shop scheduling problem to minimize the makespan;European Journal of Operational Research;2021-03

4. Data-driven software design with Constraint Oriented Multi-variate Bandit Optimization (COMBO);Empirical Software Engineering;2020-08-18

5. On the Effect of Learned Clauses on Stochastic Local Search;Theory and Applications of Satisfiability Testing – SAT 2020;2020

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3