摘要:

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.

ISSN:0233-1934    

DOI:10.1080/02331938808843401

出版商:Akademic-Verlag    

年代:1988

数据来源: Taylor

摘要:

In this note we consider a vector-valued decision problem for finite stochastic cellular systems, based on the Pareto-minimum of vectors, components of which are average costs corresponding to the cells of the system. We give a policy-improvement algorithm and show, under which conditions a policy is optimal.

ISSN:0233-1934    

DOI:10.1080/02331938808843402

出版商:Akademic-Verlag    

年代:1988

数据来源: Taylor

摘要:

Karr, Alan F.: Point Processes and their Statistical Inference. Vol. 2, Marcel Dekker New York, 1986, 490 S., ISBN 0-8247-7513-9.

ISSN:0233-1934    

DOI:10.1080/02331938808843403

出版商:Akademic-Verlag    

年代:1988

数据来源: Taylor

ISSN:0233-1934    

DOI:10.1080/02331938808843390

出版商:Akademic-Verlag    

年代:1988

数据来源: Taylor