排序方式: 共有88条查询结果,搜索用时 15 毫秒
11.
Andrew Newman 《战略研究杂志》2013,36(1):59-88
The current Bush Administration considers ‘outlaw regimes’ and their terrorist clients acquiring weapons of mass destruction (WMD) the gravest danger to international security. Thus, arms control, proliferation and terrorism are inextricably linked. The administration also believes that arms control and non-proliferation, as traditionally practiced, do not provide effective tools for preventing WMD spread. As evidenced in Iraq, Washington subscribes to an interventionist policy of rolling back WMD programs it considers threatening. This article examines the logic that underpins US arms control and proliferation thinking and considers the implications of US policy for relations with other states deemed to be proliferation risks. 相似文献
12.
Chinese Theater and Strategic Missile Force Modernization and its Implications for the United States
The People's Republic of China (PRC), no longer content with its longstanding ‘minimalist’ nuclear posture and strategy, is enhancing the striking power and survivability of its theater and strategic missile forces and rethinking its nuclear doctrine in ways that may pose serious challenges for the United States. Although the modernization of Chinese nuclear and missile forces may ultimately result in greater strategic deterrence stability, this change will not come about immediately or automatically. Indeed, it is entirely possible that China's growing missile capabilities could decrease crisis stability under certain circumstances, especially in the event of a US–China conflict over Taiwan. 相似文献
13.
14.
15.
16.
In this article, we propose a branch‐and‐price‐and‐cut (BPC) algorithm to exactly solve the manpower routing problem with synchronization constraints (MRPSC). Compared with the classical vehicle routing problems (VRPs), the defining characteristic of the MRPSC is that multiple workers are required to work together and start at the same time to carry out a job, that is, the routes of the scheduling subjects are dependent. The incorporation of the synchronization constraints increases the difficulty of the MRPSC significantly and makes the existing VRP exact algorithm inapplicable. Although there are many types of valid inequalities for the VRP or its variants, so far we can only adapt the infeasible path elimination inequality and the weak clique inequality to handle the synchronization constraints in our BPC algorithm. The experimental results at the root node of the branch‐and‐bound tree show that the employed inequalities can effectively improve the lower bound of the problem. Compared with ILOG CPLEX, our BPC algorithm managed to find optimal solutions for more test instances within 1 hour. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 138–171, 2016 相似文献
17.
This note calls attention to a difficulty which arises frequently in the application of stress-strength methods in reliability theory. This difficulty has led to unanticipated catastrophic failures in a number of applications. 相似文献
18.
This paper considers the problem of computing, by iterative methods, optimal policies for Markov decision processes. The policies computed are optimal for all sufficiently small interest rates. 相似文献
19.
This paper treats the problem of sequencing n jobs on two machines in a “flow shop.” (That is, each job in the shop is required to flow through the same sequence of the machines.) The processing time of a given job on a given machine is assumed to be distributed exponentially, with a known mean. The objective is to minimize the expected job completion time. This paper proves an optimal ordering rule, previously conjectured by Talwar [10]. A formula is also derived through Markov Chain analysis, which evaluates the expected job completion time for any given sequence of the jobs. In addition, the performance of a heuristic rule is discussed in the light of the optimal solution. 相似文献
20.
We consider a system that depends on a single vital component. If this component fails, the system life will terminate. If the component is replaced before its failure then the system life may be extended; however, there are only a finite number of spare components. In addition, the lifetimes of these spare components are not necessarily identically distributed. We propose a model for scheduling component replacements so as to maximize the expected system survival. We find the counterintuitive result that when comparing components' general lifetime distributions based on stochastic orderings, not even the strongest ordering provides an a priori guarantee of the optimal sequencing of components. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献