全文获取类型
收费全文 | 730篇 |
免费 | 17篇 |
出版年
2021年 | 11篇 |
2019年 | 27篇 |
2018年 | 15篇 |
2017年 | 14篇 |
2016年 | 13篇 |
2015年 | 12篇 |
2014年 | 13篇 |
2013年 | 136篇 |
2009年 | 7篇 |
2008年 | 10篇 |
2007年 | 6篇 |
2006年 | 7篇 |
2005年 | 11篇 |
2004年 | 12篇 |
2003年 | 9篇 |
2002年 | 8篇 |
2001年 | 8篇 |
2000年 | 10篇 |
1998年 | 13篇 |
1997年 | 19篇 |
1996年 | 15篇 |
1995年 | 7篇 |
1994年 | 12篇 |
1992年 | 9篇 |
1991年 | 19篇 |
1990年 | 9篇 |
1989年 | 15篇 |
1988年 | 15篇 |
1987年 | 21篇 |
1986年 | 15篇 |
1985年 | 12篇 |
1984年 | 11篇 |
1983年 | 10篇 |
1982年 | 11篇 |
1981年 | 10篇 |
1980年 | 15篇 |
1979年 | 14篇 |
1978年 | 11篇 |
1977年 | 12篇 |
1976年 | 12篇 |
1975年 | 12篇 |
1974年 | 10篇 |
1973年 | 14篇 |
1972年 | 9篇 |
1971年 | 13篇 |
1970年 | 10篇 |
1969年 | 8篇 |
1968年 | 10篇 |
1967年 | 8篇 |
1966年 | 9篇 |
排序方式: 共有747条查询结果,搜索用时 15 毫秒
661.
662.
Jatinder N. D. Gupta 《海军后勤学研究》1976,23(2):235-243
In this paper the problem of finding an optimal schedule for the n-job, M-machine flowshop scheduling problem is considered when there is no intermediate space to hold partially completed jobs and the objective function is to minimize the weighted sum of idle times on all machines. By assuming that jobs are processed as early as possible, the problem is modeled as a traveling salesman problem and solved by known solution techniques for the traveling salesman problem. A sample problem is solved and a special case, one involving only two machines, is discussed. 相似文献
663.
Gary M. Roodman 《海军后勤学研究》1974,21(4):595-607
This paper develops a method for doing postoptimality analysis on the mixed integer programming problem. The proposed procedures form a natural adjunct to enumerative I.P. algorithms that are linear programming based, and they are designed, in effect, to capitalize on insights generated as the problem is initially solved to do subsequent analysis upon it. In particular, limited ranging analysis is possible on selected parameters, as is the efficient resolving of the problem following parameter changes. 相似文献
664.
Recent efforts in the field of dynamic programming have explored the feasibility of solving certain classes of integer programming problems by recursive algorithms. Special recursive algorithms have been shown to be particularly effective for problems possessing a 0–1 attribute matrix displaying the “nesting property” studied by, Ignall and Veinott in inventory theory and by Glover in network flows. This paper extends the class of problem structures that has been shown amenable to recursive exploitation by providing an efficient dynamic programming approach for a general transportation scheduling problem. In particular, we provide alternative formulations lor the scheduling problem and show how the most general of these formulations can be readily solved vis a vis recursive techniques. 相似文献
665.
This paper investigates the problem of choosing between two simple hypothesis, H0 and H1, in terms of independent, identically distributed random variables, when observations can be taken in groups. At any stage in the decision process it must be decided whether to stop and take action now or to continue, in which case the size of the next group of observations must be decided upon. The problem is to find an optimal procedure incorporating a stopping, group size (batch) and terminal action rule. It is proven, in general, that the optimal stopping and terminal action rule is of the sequential probability ratio type (SPRT). Fixed stopping rules of the SPRT type are studied and an iterative procedure of the policy improvement type, both with and without a value determination step, is developed. It is shown, for the general situation, that both the average risk and scheduling rule converge to the optima. Also, six suboptimal scheduling rules are considered with respect to the average risks they achieve. Numerical results are presented to illustrate the effectiveness of the procedures. 相似文献
666.
667.
Paul D. Berger 《海军后勤学研究》1972,19(1):159-164
This paper poses a prediction problem in which a linear model is assumed. With a “zero-one” loss structure as the loss from incorrect prediction, it is suggested that least squares may not be appropriate for estimating the parameters of the model. An alternate criterion is proposed and integer programming is used in order to find the estimates, given the proposed criterion. 相似文献
668.
One approach to the evaluation of the performance of multiprogranmed computer systems includes the development of Monte Carlo simulations of transitions of programs within such systems, and their strengthening by control variable and concomitant variable methods. An application of such a combination of analytical, numerical, and Monte Carlo approaches to a model of system overhead in a paging machine is presented. 相似文献
669.
Work by the present authors on life distributions derived from stochastic hazard functions [4] is related to certain articles that have appeared in this journal. This relationship is illustrated. The emphasis of this article is upon problems of parameter estimation. 相似文献
670.
Satya D. Dubey 《海军后勤学研究》1969,16(1):37-40
Logistic distribution is widely used in describing biological, engineering, industrial, and various other types of data. In this paper it is shown that this distribution is a special case of a compound generalized extreme value distribution which is derived by compounding a generalized extreme value distribution with a gamma distribution. The paper contains several useful results relevant to these distribution functions. 相似文献