首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   215篇
  免费   8篇
  2021年   4篇
  2020年   2篇
  2019年   6篇
  2018年   5篇
  2017年   5篇
  2016年   4篇
  2014年   5篇
  2013年   30篇
  2011年   2篇
  2010年   3篇
  2009年   4篇
  2008年   3篇
  2006年   3篇
  2005年   3篇
  2004年   3篇
  2003年   2篇
  2002年   6篇
  2001年   4篇
  2000年   3篇
  1999年   2篇
  1998年   2篇
  1997年   5篇
  1996年   2篇
  1995年   2篇
  1994年   3篇
  1993年   8篇
  1992年   3篇
  1991年   4篇
  1989年   3篇
  1988年   10篇
  1987年   3篇
  1986年   6篇
  1985年   9篇
  1984年   8篇
  1983年   2篇
  1982年   2篇
  1980年   5篇
  1979年   4篇
  1978年   4篇
  1977年   6篇
  1976年   2篇
  1974年   6篇
  1973年   1篇
  1972年   2篇
  1971年   7篇
  1970年   3篇
  1969年   4篇
  1968年   1篇
  1967年   2篇
  1966年   1篇
排序方式: 共有223条查询结果,搜索用时 46 毫秒
181.
We study the quadratic bottleneck problem (QBP) which generalizes several well‐studied optimization problems. A weak duality theorem is introduced along with a general purpose algorithm to solve QBP. An example is given which illustrates duality gap in the weak duality theorem. It is shown that the special case of QBP where feasible solutions are subsets of a finite set having the same cardinality is NP‐hard. Likewise the quadratic bottleneck spanning tree problem (QBST) is shown to be NP‐hard on a bipartite graph even if the cost function takes 0–1 values only. Two lower bounds for QBST are derived and compared. Efficient heuristic algorithms are presented for QBST along with computational results. When the cost function is decomposable, we show that QBP is solvable in polynomial time whenever an associated linear bottleneck problem can be solved in polynomial time. As a consequence, QBP with feasible solutions form spanning trees, s‐t paths, matchings, etc., of a graph are solvable in polynomial time with a decomposable cost function. We also show that QBP can be formulated as a quadratic minsum problem and establish some asymptotic results. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011  相似文献   
182.
The bivariate negative binomial distribution of Mitchell and Paulson [17] for the case b = c = 0 is shown to be equivalent to the accident proneness model of Edwards and Gurland [4] and Subrahmaniam [19,20]. The diagonal series expansion of its joint probability function is then derived. Two other formulations of this distribution are also considered: (i) as a mixture model, which showed how it arises as the discrete analogue to the Wicksell-Kibble bivariate gamma distribution, and (ii) as a consequence of the linear birth-and-death process with immigration.  相似文献   
183.
184.
185.
186.
It is proposed to describe multiple air-to-air combat having a moderate number of participants with the aid of a stochastic process based on end-game duels. A simple model describing the dominant features of air combat leads to a continuous time discrete-state Markov process. Solution of the forward Kolmogorov equations enables one to investigate the influence of initial force levels and performance parameters on the outcome probabilities of the multiple engagement. As is illustrated, such results may be useful in the decision-making process for aircraft and weapon system development planning. Some comparisons are made with Lanchester models as well as with a semi-Markov model.  相似文献   
187.
The historic max-min problem is examined as a discrete process rather than in its more usual continuous mode. Since the practical application of the max-min model usually involves discrete objects such as ballistic missiles, the discrete formulation of the problem seems quite appropriate. This paper uses an illegal modification to the dynamic programming process to obtain an upper bound to the max-min value. Then a second but legal application of dynamic programming to the minimization part of the problem for a fixed maximizing vector will give a lower bound to the max-min value. Concepts of optimal stopping rules may be applied to indicate when sufficiently near optimal solutions have been obtained.  相似文献   
188.
The objective of this paper is to determine the optimum inventory policy for a multi-product periodic review dynamic inventory system. At the beginning of each period two decisions are made for each product. How much to “normal order” with a lead time of λn periods and how much to “emergency order” with a lead time of λe periods, where λe = λn - 1. It is assumed that the emergency ordering costs are higher than the normal ordering costs. The demands for each product in successive periods are assumed to form a sequence of independent identically distributed random variables with known densities. Demands for individual products within a period are assumed to be non-negative, but they need not be independent. Whenever demand exceeds inventory their difference is backlogged rather than lost. The ordering decisions are based on certain costs and two revenue functions. Namely, the procurement costs which are assumed to be linear for both methods of ordering, convex holding and penalty costs, concave salvage gain functions, and linear credit functions. There is a restriction on the total amount that can be emergency ordered for all products. The optimal ordering policy is determined for the one and N-period models.  相似文献   
189.
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.  相似文献   
190.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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