...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Constraints >A constraint-based local search backend for MiniZinc
【24h】

A constraint-based local search backend for MiniZinc

机译：基于约束的MiniZinc本地搜索后端

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

MiniZinc is a modelling language for combinatorial problems, which can then be solved by a solver provided in a backend. There are many backends, based on technologies such as constraint programming, integer programming, or Boolean satisfiability solving. However, to the best of our knowledge, there is currently no constraint-based local search (CBLS) backend. We discuss the challenges to develop such a backend and give an overview of the design of a CBLS backend for MiniZinc. Experimental results show that for some MiniZinc models, our CBLS backend, based on the OscaR/CBLS solver, is able to give good-quality results in competitive time.
机译：MiniZinc是用于组合问题的建模语言，然后可以通过后端提供的求解器对其进行求解。基于诸如约束编程，整数编程或布尔可满足性求解之类的技术，有许多后端。但是，据我们所知，当前没有基于约束的本地搜索（CBLS）后端。我们讨论了开发这种后端的挑战，并概述了MiniZinc的CBLS后端的设计。实验结果表明，对于某些MiniZinc模型，基于OscaR / CBLS求解器的CBLS后端能够在竞争时间内提供高质量的结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号