学习广义强分支用于集合覆盖、集合打包和0-1背包问题

Learning generalized strong branching for set covering, set packing, and 0–1 knapsack problems

• Yu Yang 通讯
• Natashia Boland
• Bistra Dilkina
• Martin Savelsbergh