首页   按字顺浏览 期刊浏览 卷期浏览 Improved lower and upper bounds for the number of feasible solutions to a knapsaek prob...
Improved lower and upper bounds for the number of feasible solutions to a knapsaek problem

 

作者: M. Hujter,  

 

期刊: Optimization  （Taylor Available online 1988）
卷期: Volume 19, issue 6  

页码: 889-894

 

ISSN:0233-1934

 

年代: 1988

 

DOI:10.1080/02331938808843401

 

出版商: Akademic-Verlag

 

关键词: Discrete programming;knapsack problem;geometrical methods;Brunn-Minkowski inequality;Primary: 90 C 10

 

数据来源: Taylor

 

摘要:

Some known results about lower and upper bounds for the number of distinct solutions to a discrete knapsack problem are given. In this paper some sharper bounds are proved by using geometrical methods. The proof of the upper bound is based on the famous (and deep) Brunn-Minkowski inequality. and It is a new and interesting application method of geometrical arguments in discrete programming.

 

点击下载:  PDF (184KB)



返 回