当前位置: X-MOL 学术arXiv.cs.OH › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Chook -- A comprehensive suite for generating binary optimization problems with planted solutions
arXiv - CS - Other Computer Science Pub Date : 2020-05-28 , DOI: arxiv-2005.14344
Dilina Perera, Inimfon Akpabio, Firas Hamze, Salvatore Mandra, Nathan Rose, Maliheh Aramon, and Helmut G. Katzgraber

We present Chook, an open-source Python-based tool to generate discrete optimization problems of tunable complexity with a priori known solutions. Chook provides a cross-platform unified environment for solution planting using a number of techniques, such as tile planting, Wishart planting, equation planting, and deceptive cluster loop planting. Chook also incorporates planted solutions for higher-order (beyond quadratic) binary optimization problems. The support for various planting schemes and the tunable hardness allows the user to generate problems with a wide range of complexity on different graph topologies ranging from hypercubic lattices to fully-connected graphs.

中文翻译:

Chook - 一个综合套件,用于生成带有植入解决方案的二元优化问题

我们提出了 Chook,这是一种基于 Python 的开源工具,可使用先验已知解决方案生成具有可调复杂性的离散优化问题。Chook 使用多种技术为解决方案种植提供跨平台的统一环境,例如瓷砖种植、Wishart 种植、方程种植和欺骗性集群循环种植。Chook 还为高阶(二次以上)二元优化问题合并了种植解决方案。对各种种植方案的支持和可调硬度允许用户在从超立方晶格到全连接图的不同图拓扑上生成具有广泛复杂性的问题。
更新日期:2020-06-01
down
wechat
bug