求解稀疏二次型无约束二元优化问题时加速禁忌搜索的数据结构

IF 1.1 4区计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE

Journal of Heuristics Pub Date : 2022-04-27 DOI:10.1007/s10732-022-09498-0

Ricardo N. Liang, Eduardo A. J. Anacleto, C. N. Meneses

引用次数: 1

摘要

本文章由计算机程序翻译，如有差异，请以英文原文为准。

Data structures for speeding up Tabu Search when solving sparse quadratic unconstrained binary optimization problems

查看原文本刊更多论文

Data structures for speeding up Tabu Search when solving sparse quadratic unconstrained binary optimization problems

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Heuristics 工程技术-计算机：理论方法

CiteScore

5.80

自引率

0.00%

发文量

审稿时长

6 months

期刊介绍： The Journal of Heuristics provides a forum for advancing the state-of-the-art in the theory and practical application of techniques for solving problems approximately that cannot be solved exactly. It fosters the development, understanding, and practical use of heuristic solution techniques for solving business, engineering, and societal problems. It considers the importance of theoretical, empirical, and experimental work related to the development of heuristics. The journal presents practical applications, theoretical developments, decision analysis models that consider issues of rational decision making with limited information, artificial intelligence-based heuristics applied to a wide variety of problems, learning paradigms, and computational experimentation. Officially cited as: J Heuristics Provides a forum for advancing the state-of-the-art in the theory and practical application of techniques for solving problems approximately that cannot be solved exactly. Fosters the development, understanding, and practical use of heuristic solution techniques for solving business, engineering, and societal problems. Considers the importance of theoretical, empirical, and experimental work related to the development of heuristics.