.png){kind=icon}
返回
A branch & bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints
.png){kind=icon}
PRE
AI
DOI：10.1016/S0305-0548(03)00021-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a branch and bound (B&B) algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints. The formulation arose in an application to transportation management for allocating funds to highway improvements. Several model properties are developed and utilized to design a B&B solution algorithm. The algorithm solves at each node of the B&B tree a linear relaxation using an adaptation of an existing algorithm for the linear multiple choice knapsack problem. The special relationship between the parent and children subproblems is exploited by the algorithm. This results in high efficiency and low storage space requirements. The worst case complexity of the algorithm is analyzed and computational results that demonstrate its efficiency in the average case are reported.
Keyword:
mixed integer knapsack problem
branch-and-bound algorithm
multiple choice constraints
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Biocontrol of blue mold of apple byCandida membranifaciensin combination with silicon苹果青霉病的生物防治及硅与Candida membranifaciens的联合应用
PREAI
分享收藏
查看更多内容