Heavy-Head Sampling for Learn-to-Branch on Multiple Knapsack Problems-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Heavy-Head Sampling for Learn-to-Branch on Multiple Knapsack Problems

Published:2023-07-24 Issue: Volume: Page:
ISSN:
Container-title:2023 42nd Chinese Control Conference (CCC)
language:
Short-container-title:

Author:

Niu Yajie¹,Peng Chen²,Dou Xinrui¹,Wu Youlong¹,Wang Yaxin³

Affiliation:

1. School of Communication and Electronic Engineering, Jishou University,Jishou,P. R. China,416000

2. College of Computer Science and Engineering, Jishou University,Jishou,P. R. China,416000

3. College of Electronic Information Engineering, Hebei University,Baoding,P. R. China,071000

Publisher

IEEE

Link

http://xplorestaging.ieee.org/ielx7/10239690/10239711/10240560.pdf?arnumber=10240560

Reference25 articles.

1. Approximation algorithms for the multiple knapsack problem with assignment restrictions;Dawande;Journal of combinatorial optimization,2000

2. Learning to branch with tree mdps;Scavuzzo;Advances in Neural Information Processing Systems,2022

3. A comprehensive review of Branch-and-Bound algorithms: Guidelines and directions for further research on the flowshop scheduling problem

4. Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning

5. Learning to branch;Balcan,2018

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP