首页   按字顺浏览 期刊浏览 卷期浏览 Computational results with a branch‐and‐bound algorithm for the general knapsack problem
Computational results with a branch‐and‐bound algorithm for the general knapsack problem

 

作者: R. L. Bulfin,   R. G. Parker,   C. M. Shetty,  

 

期刊: Naval Research Logistics Quarterly  （WILEY Available online 1979）
卷期: Volume 26, issue 1  

页码: 41-46

 

ISSN:0028-1441

 

年代: 1979

 

DOI:10.1002/nav.3800260105

 

出版商: Wiley Subscription Services, Inc., A Wiley Company

 

数据来源: WILEY

 

摘要:

AbstractIn this paper, a branch‐and‐bound procedure is presented for treating the general knapsack problem. The fundamental notion of the procedure involves a variation of traditional branching strategies as well as the incorporation of penalties in order to improve bounds. Substantial computational experience has been obtained, the results of which would indicate the feasibility of the procedure for problems of large s

 

点击下载:  PDF (416KB)



返 回