全文获取类型
收费全文 | 666篇 |
免费 | 20篇 |
出版年
2019年 | 14篇 |
2018年 | 8篇 |
2017年 | 12篇 |
2016年 | 9篇 |
2015年 | 12篇 |
2014年 | 10篇 |
2013年 | 112篇 |
2010年 | 7篇 |
2009年 | 7篇 |
2008年 | 7篇 |
2007年 | 7篇 |
2004年 | 11篇 |
2003年 | 9篇 |
2002年 | 8篇 |
2001年 | 10篇 |
2000年 | 8篇 |
1999年 | 7篇 |
1998年 | 12篇 |
1997年 | 13篇 |
1996年 | 14篇 |
1995年 | 15篇 |
1994年 | 15篇 |
1993年 | 14篇 |
1992年 | 17篇 |
1991年 | 18篇 |
1990年 | 10篇 |
1989年 | 12篇 |
1988年 | 16篇 |
1987年 | 15篇 |
1986年 | 9篇 |
1985年 | 14篇 |
1984年 | 15篇 |
1983年 | 8篇 |
1982年 | 9篇 |
1981年 | 14篇 |
1980年 | 14篇 |
1979年 | 14篇 |
1978年 | 11篇 |
1977年 | 9篇 |
1976年 | 11篇 |
1975年 | 13篇 |
1974年 | 11篇 |
1973年 | 8篇 |
1972年 | 12篇 |
1971年 | 12篇 |
1970年 | 7篇 |
1969年 | 8篇 |
1968年 | 10篇 |
1967年 | 9篇 |
1966年 | 8篇 |
排序方式: 共有686条查询结果,搜索用时 15 毫秒
191.
P. C. Joshi 《海军后勤学研究》1979,26(4):675-679
A recurrence relation between the moments of order statistics from the gamma distribution having an integer parameter r is obtained. It is shown that if the negative moments of orders -(r?1), …, ?1 of the smallest order statistic in random samples of size n are known, then one can obtain all the moments. Tables of negative moments for r = 2 (1) 5 are also given. 相似文献
192.
For large numbers of perfectly reliable, optimally targeted warheads the square-root law approximates the expected fraction damage achieved on an area target. In this paper a more exact expression is derived for this damage fraction which Holds for all numbers of warheads. This expression is shown to converge to the square-root law when a large number of warheads are fired. The more exact expression is used in a procedure to calculate expected damage when warheads are unreliable, and this procedure is shown to be superior to a modified square-root approximation which has been used previously. 相似文献
193.
This paper presents an algorithm for solving the integer programming problem possessing a separable nonlinear objective function subject to linear constraints. The method is based on a generalization of the Balas implicit enumeration scheme. Computational experience is given for a set of seventeen linear and seventeen nonlinear test problems. The results indicate that the algorithm can solve the nonlinear integer programming problem in roughly the equivalent time required to solve the linear integer programming problem of similar size with existing algorithms. Although the algorithm is specifically designed to solve the nonlinear problem, the results indicate that the algorithm compares favorably with the Branch and Bound algorithm in the solution of linear integer programming problems. 相似文献
194.
A duality theory is developed for mathematical programs with strictly quasi-concave objective functions to be maximized over a convex set. This work broadens the duality theory of Rockafellar and Peterson from concave (convex) functions to quasi-concave (quasi-convex) functions. The theory is closely related to the utility theory in economics. An example from economic planning is examined and the solution to the dual program is shown to have the properties normally associated with market prices. 相似文献
195.
In 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 size. 相似文献
196.
D. Siegmund 《海军后勤学研究》1979,26(1):57-67
One-sided sequential tests for the mean of an exponential distribution are proposed, and the related confidence intervals are computed. The tests behave like the classical sequential probability-ration test when the mean is small and like a fixed-time test when the mean is large and accurate estimation is important. 相似文献
197.
A Markovian model is presented for the development of an optimal repair-replacement policy for the situation requiring a decision only at failure. The problem is characterized by the presence of growth which is integrated into the formulation. The model is applied to an actual problem, with data analysis and results given. Substantial savings are indicated. 相似文献
198.
A model is developed which may be used to determine the expected total cost of quality control per inspection lot under acceptance sampling by variables where several characteristics are to be simultaneously controlled. Optimization of the model is accomplished through the application of a conventional search procedure. The sensitivity of the model and the optimum solution to the shape of the underlying probability distributions is discussed and associated analyses are presented through an example. 相似文献
199.
Hanif D. Sherali 《海军后勤学研究》1981,28(3):447-462
In this paper we consider dual angular and angular structured mixed integer programs which arise in some practical applications. For these problems we describe efficient methods for generating a desirable set of Benders' cuts with which one may initialize the partitioning scheme of Benders. Our research is motivated by the computational experience of McDaniel and Devine who have shown that the set of Benders' cuts which are binding at the optimum to the linear relaxation of the mixed integer program, play an important role in determining an optimal mixed integer solution. As incidental results in our development, we provide some useful remarks regarding Benders' and Dantzig-Wolfe's decomposition procedures. The computational experience reported seems to support the expedients recommended in this paper. 相似文献
200.
This paper deals with the problem of scheduling items (tasks, employees, equipment, etc.) over a finite time horizon so as to minimize total cost expenditures while maintaining a predefined separation between certain items. The problem is cyclic, because the same schedule will be repeated over several consecutive time periods of equal length. Thus, requirements are present to maintain the separation of items not only within the individual time periods considered, but also between items in adjoining periods. A special purpose branch-and-bound algorithm is developed to solve this scheduling problem by taking advantage of its cyclic nature. Computational results are given. 相似文献