首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   578篇
  免费   0篇
  578篇
  2019年   12篇
  2017年   17篇
  2016年   10篇
  2015年   14篇
  2014年   15篇
  2013年   109篇
  2012年   5篇
  2011年   5篇
  2010年   8篇
  2009年   11篇
  2007年   6篇
  2006年   8篇
  2005年   9篇
  2004年   11篇
  2003年   5篇
  2002年   10篇
  2001年   4篇
  2000年   7篇
  1999年   6篇
  1998年   12篇
  1997年   6篇
  1996年   8篇
  1995年   5篇
  1994年   15篇
  1993年   14篇
  1992年   8篇
  1991年   14篇
  1990年   8篇
  1989年   14篇
  1988年   14篇
  1987年   15篇
  1986年   16篇
  1985年   12篇
  1984年   8篇
  1983年   7篇
  1982年   7篇
  1981年   8篇
  1980年   5篇
  1979年   8篇
  1978年   12篇
  1976年   7篇
  1975年   6篇
  1974年   8篇
  1973年   7篇
  1972年   9篇
  1971年   4篇
  1970年   9篇
  1969年   6篇
  1968年   4篇
  1967年   6篇
排序方式: 共有578条查询结果,搜索用时 0 毫秒
31.
This article provides formulas for estimating the parameters to be used in the basic EOQ lot-size model. The analysis assumes that the true values of these parameters are unknown over known ranges and perhaps nonstationary over time. Two measures of estimator “goodness” are derived from EOQ sensitivity analysis. Formulas are given for computing the minimax choice and the minimum expected value choice for the parameter estimates using both measures of estimator “goodness”. A numerical example is included.  相似文献   
32.
33.
This article introduces a new conceptual and methodological framework for the use of decision makers and their interactions with the computer in bicriterion decision making. The new method, called the multirun interactive method, attempts to estimate the prior of the decision maker on his uncertain preference nature using the minimum cross-entropy principle. A computational study is performed with four hypothesized prior distributions under various interaction conditions. Other important aspects related to the method, such as implementation of the method, decision making under certainty, decision making with multiple decision makers, and bicriterion integer programming, are also discussed.  相似文献   
34.
We consider the problem of finding a plan that maximizes the expected discounted return when extracting a nonrenewable resource having uncertain reserves. An extraction plan specifies the rate at which the resource is extracted as a function of time until the resource is exhausted or the time horizon is reached. The return per unit of resource extracted may depend on the rate of extraction, time, and the amount of resource previously extracted. We apply a new method called the generalized search optimization technique to find qualitative features of optimal plans and to devise algorithms for the numerical calculation of optimal plans.  相似文献   
35.
Variations of Hale's channel assignment problem, the L(j, k)‐labeling problem and the radio labeling problem require the assignment of integers to the vertices of a graph G subject to various distance constraints. The λj,k‐number of G and the radio number of G are respectively the minimum span among all L(j, k)‐labelings, and the minimum span plus 1 of all radio labelings of G (defined in the Introduction). In this paper, we establish the λj,k‐number of ∏ K for pairwise relatively prime integers t1 < t2 < … < tq, t1 ≥ 2. We also show the existence of an infinite class of graphs G with radio number |V(G)| for any diameter d(G). © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2005  相似文献   
36.
37.
Using a system-point (SP) method of level crossings, we derive the stationary distribution of the inventory level (stock on hand) in a continuous-review inventory system with compound Poisson demand, Erlang as well as hyperexponentially distributed lead times, and lost sales. This distribution is then used to formulate long-run average cost functions with/without a service level constraint. Some numerical results are also presented, and compared with the Hadley and Whitin heuristic. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 259–278, 1998  相似文献   
38.
39.
In the context of both discrete time salvo models and continuous time Lanchester models we examine the effect on naval combat of lethality: that is, the relative balance between the offensive and defensive attributes of the units involved. We define three distinct levels of lethality and describe the distinguishing features of combat for each level. We discuss the implications of these characteristics for naval decision‐makers; in particular, we show that the usefulness of the intuitive concept “more is better” varies greatly depending on the lethality level. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.  相似文献   
40.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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