首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   369篇
  免费   6篇
  375篇
  2021年   7篇
  2019年   7篇
  2018年   4篇
  2017年   3篇
  2016年   7篇
  2015年   2篇
  2014年   5篇
  2013年   55篇
  2012年   3篇
  2009年   4篇
  2007年   12篇
  2005年   2篇
  2004年   3篇
  2003年   7篇
  2002年   6篇
  2001年   2篇
  2000年   3篇
  1999年   3篇
  1998年   7篇
  1997年   8篇
  1996年   9篇
  1995年   3篇
  1994年   6篇
  1993年   10篇
  1992年   7篇
  1991年   9篇
  1990年   10篇
  1989年   17篇
  1988年   14篇
  1987年   7篇
  1986年   13篇
  1985年   7篇
  1984年   4篇
  1983年   3篇
  1982年   10篇
  1981年   6篇
  1980年   7篇
  1979年   9篇
  1978年   8篇
  1977年   5篇
  1976年   5篇
  1975年   4篇
  1974年   8篇
  1973年   5篇
  1972年   3篇
  1971年   7篇
  1970年   6篇
  1969年   5篇
  1967年   6篇
  1948年   4篇
排序方式: 共有375条查询结果,搜索用时 2 毫秒
71.
72.
A model, for assessing the effectiveness of alternative force structures in an uncertain future conflict, is presented and exemplified. The methodology is appropriate to forces (e.g., the attack submarine force) where alternative unit types may be employed, albeit at differing effectiveness, in the same set of missions. Procurement trade-offs, and in particular the desirability of special purpose units in place of some (presumably more expensive) general purpose units, can be addressed by this model. Example calculations indicate an increase in the effectiveness of a force composed of general purpose units, relative to various mixed forces, with increase in the uncertainty regarding future conflicts.  相似文献   
73.
74.
In this article, we are concerned with scheduling stochastic jobs in a flowshop with m machines and zero intermediate storage. We assume that there are n - 2 identically distributed and 2 fast stochastic jobs. Roughly, the main result states that the makespan is stochastically minimized by placing one of the fast jobs first and the other last.  相似文献   
75.
Hakimi has considered the problem of finding an optimal location for a single service center, such as a hospital or a police station. He used a graph theoretic model to represent the region being serviced. The communities are represented by the nodes while the road network is represented by the ares of the graph. In his work, the objective is one of minimizing the maximum of the shortest distances between the vertices and the service center. In the present work, the region being serviced is represented by a convex polygon and communities are spread over the entire region. The objective is to minimize the maximum of Euclidian distances between the service center and any point in the polygon. Two methods of solution presented are (i) a geometric method, and (ii) a quadratic programming formulation. Of these, the geometric method is simpler and more efficient. It is seen that for a class of problems, the geometric method is well suited and very efficient while the graph theoretic method, in general, will give only approximate solutions in spite of the increased efforts involved. But, for a different class of problems, the graph theoretic approach will be more appropriate while the geometric method will provide only approximate solutions though with ease. Finally, some feasible applications of importance are outlined and a few meaningful extensions are indicated.  相似文献   
76.
77.
Several approximate procedures are available in the literature for obtaining confidence intervals for the parameter A of an exponential distribution based on time truncated samples. This paper contains the results of an empirical study comparing three of these procedures.  相似文献   
78.
The present article considers a problem of missile warfare. It is formulated as a problem of economics and treated as a differential game. Some optimal strategies of targeting and firing of missiles are derived. Conditions under which such a war can be prevented are also developed.  相似文献   
79.
An inventory model in which future demand is affected by stockouts has been considered recently by B. L. Schwartz. Some generalizations of Schwartz's model are presented in this paper and properties of the optimal policies are determined. In the case of deterministic demand, a set-up cost is included and a mixture of backlogged and nonbacklogged orders is allowed during stockout. It is proved that the optimal policy entails either no stockout or continual stockout, depending on the values of three parameters. For stochastic demand, the effect of stockouts on demand density is postulated, the resulting optimal inventory policy is discussed, and an example involving an exponential density function is then analyzed in detail.  相似文献   
80.
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.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号