arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2202.02725math.OC
收藏

混合整数线性规划的有效原算法

Efficient primal heuristics for mixed-integer linear programs

Akang Wang, Linxin Yang, Sha Lai, Xiaodong Luo, Xiang Zhou, Haohan Huang, Shengcheng Shao, Yuanming Zhu, Dong Zhang, Tao Quan

摘要:

本文是关于我们在组合优化机器学习NeurIPS 2021竞赛中的主要任务的简短报告。对于我们感兴趣的每个数据集的竞争,我们提出了定制的原始启发式方法,以有效地识别高质量的可行解。计算研究表明,我们提出的方法优于竞争对手的。

英文摘要:

This paper is a short report about our work for the primal task in the Machine Learning for Combinatorial Optimization NeurIPS 2021 Competition. For each dataset of our interest in the competition, we propose customized primal heuristic methods to efficiently identify high-quality feasible solutions. The computational studies demonstrate the superiority of our proposed approaches over the competitors'.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑