A Fast Algorithm for Knapsack Problem with Conflict Graph
Asia Pacific Journal of Operational Research（2021）
关键词
Combinatorial optimization,branch-and-bound,knapsack problem with conflict graph,maximum weight stable set problem
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要