Combinatorial Optimization Problems
收藏arXiv2025-09-30 收录
下载链接：
https://drive.google.com/file/d/1cQDaj1ZdlQMYZC-NfBdnBwqspSzbjVkt/view
下载链接
链接失效反馈官方服务：
资源简介：
该数据集包含四个不同的组合优化问题：最大切割（MaxCut）、带权有向顶点覆盖（MaxCov）、电影推荐（MovRec）以及影响与利用营销（InfExp）。此外，该数据集与包含实验脚本的源代码相链接，涵盖了具有不同约束条件和目标的多项问题，其任务领域为组合优化。
This dataset includes four distinct combinatorial optimization problems: MaxCut, Weighted Directed Vertex Cover (MaxCov), Movie Recommendation (MovRec), and Influence and Exploitation Marketing (InfExp). Additionally, this dataset is linked to source code that contains experimental scripts. It covers multiple problems with different constraints and objectives, and its task domain falls within the scope of combinatorial optimization.
