全文获取类型
收费全文 | 410篇 |
免费 | 8篇 |
出版年
2021年 | 4篇 |
2020年 | 5篇 |
2019年 | 10篇 |
2018年 | 8篇 |
2017年 | 13篇 |
2016年 | 12篇 |
2015年 | 7篇 |
2014年 | 11篇 |
2013年 | 68篇 |
2012年 | 3篇 |
2011年 | 6篇 |
2010年 | 8篇 |
2009年 | 9篇 |
2008年 | 7篇 |
2007年 | 3篇 |
2006年 | 6篇 |
2005年 | 6篇 |
2004年 | 5篇 |
2003年 | 7篇 |
2002年 | 11篇 |
2001年 | 5篇 |
2000年 | 4篇 |
1999年 | 4篇 |
1998年 | 6篇 |
1997年 | 12篇 |
1996年 | 7篇 |
1995年 | 9篇 |
1994年 | 8篇 |
1993年 | 11篇 |
1992年 | 7篇 |
1991年 | 7篇 |
1990年 | 6篇 |
1989年 | 8篇 |
1988年 | 15篇 |
1987年 | 5篇 |
1986年 | 11篇 |
1985年 | 13篇 |
1984年 | 9篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 3篇 |
1974年 | 8篇 |
1972年 | 2篇 |
1971年 | 7篇 |
1970年 | 3篇 |
1969年 | 4篇 |
1968年 | 3篇 |
1967年 | 3篇 |
排序方式: 共有418条查询结果,搜索用时 15 毫秒
181.
In the study of complex queueing systems, analysis techniques aimed al providing exact solutions become ineffective. Approximation techniques provide an attractive alternative in such cases. This paper gives an overview of different types of approximation techniques available in the literature and points out their relative merits. Also, the need for proper validation procedures of approximation techniques is emphasized. 相似文献
182.
William P. Pierskalla 《海军后勤学研究》1969,16(2):217-228
A stochastic single product convex cost inventory problem is considered in which there is a probability, πj, that the product will become obsolete in the future period j. In an interesting paper, Barankin and Denny essentially formulate the model, but do not describe some of its interesting and relevant ramifications. This paper is written not only to bring out some of these ramifications, but also to describe some computational results using this model. The computational results show that if obsolescence is a distinct possibility in the near future, it is quite important that the probabilities of obsolescence be incorporated into the model before computing the optimal policies. 相似文献
183.
184.
185.
186.
187.
Martin Samuels 《Defense & Security Analysis》1990,6(2):215-219
If Germany Attacks: the Battle in Depth in the West. By Captain Graeme C. Wynne. Faber & Faber, London (1940) [reprinted by Greenwood Press, Westport, CT (1976)] 相似文献
188.
189.
Harold P. Benson 《海军后勤学研究》1985,32(1):165-177
We present a new algorithm for solving the problem of minimizing a nonseparable concave function over a polyhedron. The algorithm is of the branch-and-bound type. It finds a globally optimal extreme point solution for this problem in a finite number of steps. One of the major advantages of the algorithm is that the linear programming subproblems solved during the branch-and-bound search each have the same feasible region. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some preliminary computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several bilinear programming problems with the code. 相似文献
190.