首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   70篇
  免费   0篇
  2020年   1篇
  2019年   4篇
  2018年   3篇
  2017年   2篇
  2016年   1篇
  2014年   1篇
  2013年   23篇
  2012年   2篇
  2011年   2篇
  2010年   1篇
  2009年   2篇
  2008年   1篇
  2007年   1篇
  2005年   1篇
  2004年   3篇
  2002年   1篇
  2001年   2篇
  1999年   1篇
  1998年   1篇
  1997年   1篇
  1996年   2篇
  1994年   1篇
  1992年   1篇
  1989年   2篇
  1988年   1篇
  1986年   1篇
  1985年   1篇
  1979年   1篇
  1978年   2篇
  1977年   2篇
  1976年   2篇
排序方式: 共有70条查询结果,搜索用时 15 毫秒
51.
The following problem is studied. The units of an inventory are used one by one until all have failed. Their lifetimes decrease with their ages, when they are taken out of the inventory. An item of age a is supposed to have a lifetime Y exp(-a), where Y is a random variable which does not depend on a. It is shown that in order to maximize the total lifetime the items should be taken according to the LIFO principle. This is shown for a certain class of distributions of Y. This class includes the exponential and the Pareto distributions.  相似文献   
52.
The United States is launching another defence innovation initiative to offset the growing military-technological might of countries such as China, Russia and Iran. However, by utilising emerging technologies from the commercial sector to achieve greater military power the US may further open up the technology gap within NATO. This raises serious questions for NATO’s European allies. This article probes the nature of the US’s latest innovation strategy and sets it within the strategic context facing Europe today. Whether European governments, firms and militaries will join the US in its new defence innovation drive will hinge on politico-military and industrial considerations.  相似文献   
53.
The goal of diplomats is to represent their countries’ interests through diplomacy, not arms. Because they are not military personnel, they may be perceived as at lower risk of being the target of terrorists. However, recent events have called this perception into question. Despite this danger, there has been little research on terrorist attacks against diplomats. Drawing on the terrorism studies literature, this article argues that diplomats are targeted more than non-diplomatic targets in countries where certain U.S. foreign policies are implemented. An empirical analysis of 471 attacks against U.S. diplomats from 1970 to 2011 reveals that while U.S. alliances and foreign aid increase the likelihood of attacks against diplomats, U.S. military intervention and civil war, on the other hand, increase the risk of terrorism against non-diplomatic targets. This finding is relevant because it shows terrorist attacks against diplomats result from certain types of foreign policy.  相似文献   
54.
The routine inspection of facilities storing large numbers of identical items is modeled as a two‐person, sequential game. Timely detection of illegal activity is parameterized in terms of a critical time to detection, and equilibria are derived which provide inspection strategies. Necessary conditions for deterrence of illegal behavior are discussed. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 496–505, 2001  相似文献   
55.
This paper describes the Value Added Analysis methodology which is used as part of the U.S. Army's Planning, Programming, Budgeting, and Execution System to assist the Army leadership in evaluating and prioritizing competing weapon system alternatives during the process of building the Army budget. The Value Added Analysis concept uses a family of models to estimate an alternative system's contribution to the Army's effectiveness using a multiattribute value hierarchy. A mathematical optimization model is then used to simultaneously determine an alternative's cost‐benefit and to identify an optimal mix of weapon systems for inclusion in the Army budget. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 233–253, 1999  相似文献   
56.
57.
Given a positive integer R and a weight for each vertex in a graph, the maximum-weight connected graph problem (MCG) is to find a connected subgraph with R vertices that maximizes the sum of their weights. MCG has applications to communication network design and facility expansion. The constrained MCG (CMCG) is MCG with a constraint that one predetermined vertex must be included in the solution. In this paper, we introduce a class of decomposition algorithms for MCG. These algorithms decompose MCG into a number of small CMCGs by adding vertices one at a time and building a partial graph. They differ in the ordering of adding vertices. Proving that finding an ordering that gives the minimum number of CMCGs is NP-complete, we present three heuristic algorithms. Experimental results show that these heuristics are very effective in reducing computation and that different orderings can significantly affect the number of CMCGs to be solved. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 817–837, 1998  相似文献   
58.
Given a positive integer R and a weight for each vertex in a graph, the maximum-weight connected graph (MCG) problem is to find a connected subgraph with R vertices that maximizes the sum of the weights. The MCG problem is strongly NP-complete, and we study a special case of it: the constrained MCG (CMCG) problem, which is the MCG problem with a constraint of having a predetermined vertex included in the solution. We first show that the Steiner tree problem is a special case of the CMCG problem. Then we present three optimization algorithms for the CMCG problem. The first two algorithms deal with special graphs (tree and layered graphs) and employ different dynamic programming techniques, solving the CMCG problem in polynomial times. The third one deals with a general graph and uses a variant of the Balas additive method with an imbedded connectivity test and a pruning method. We also present a heuristic algorithm for the CMCG problem with a general graph and its bound analysis. We combine the two algorithms, heuristic and optimization, and present a practical solution method to the CMCG problem. Computational results are reported and future research issues are discussed. © 1996 John Wiley & Sons, Inc.  相似文献   
59.
We consider a single-item inventory system in which the stock level can increase due to items being returned as well as decrease when demands occur. Returned items can be repaired and then used to satisfy future demand, or they can be disposed of. We identify those inventory levels where disposal is the best policy. It is shown that this problem is equivalent to a problem of controlling a single-server queue. When the return and demand processes are both Poisson, we find the optimal policy exactly. When the demand and return processes are more general, we use diffusion approximations to obtain an approximate model, which is then solved. The approximate model requires only mean and variance data. Besides the optimal policy, the output of the models includes such characteristics as the operating costs, the purchase rate for new items, the disposal rate for returned items and the average inventory level. Several numerical examples are given. An interesting by-product of our investigation is an approximation for the steady-state behavior of the bulk GI/G/1 queue with a queue limit.  相似文献   
60.
In due‐window assignment problems, jobs completed within a designated time interval are regarded as being on time, whereas early and tardy jobs are penalized. The objective is to determine the location and size of the due‐window, as well as the job schedule. We address a common due‐window assignment problem on parallel identical machines with unit processing time jobs. We show that the number of candidate values for the optimal due‐window starting time and for the optimal due‐window completion time are bounded by 2. We also prove that the starting time of the first job on each of the machines is either 0 or 1, thus introducing a fairly simple, constant‐time solution for the problem. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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