全文获取类型
收费全文 | 84篇 |
免费 | 0篇 |
专业分类
84篇 |
出版年
2021年 | 1篇 |
2019年 | 4篇 |
2018年 | 1篇 |
2017年 | 5篇 |
2016年 | 4篇 |
2014年 | 1篇 |
2013年 | 15篇 |
2011年 | 1篇 |
2010年 | 2篇 |
2009年 | 1篇 |
2007年 | 1篇 |
2006年 | 3篇 |
2005年 | 1篇 |
2004年 | 3篇 |
2003年 | 1篇 |
2002年 | 5篇 |
2000年 | 1篇 |
1998年 | 2篇 |
1993年 | 3篇 |
1992年 | 1篇 |
1991年 | 2篇 |
1989年 | 2篇 |
1988年 | 3篇 |
1985年 | 3篇 |
1984年 | 1篇 |
1983年 | 2篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1976年 | 1篇 |
1975年 | 2篇 |
1974年 | 2篇 |
1973年 | 2篇 |
1971年 | 3篇 |
1969年 | 1篇 |
1968年 | 1篇 |
排序方式: 共有84条查询结果,搜索用时 15 毫秒
71.
David O. Smith 《The Nonproliferation Review》2013,20(1):99-105
ABSTRACTIn No Use: Nuclear Weapons and U.S. National Security Policy, Thomas M. Nichols calls for a constructive rethinking about the history of nuclear weapons and the attitudes that have grown up around them. Despite dramatic reductions since the end of the Cold War, the United States still maintains a robust nuclear triad that far exceeds the needs of realistic deterrence in the twenty-first century. Nichols advocates a new strategy of minimum deterrence that includes deep unilateral reductions to the US nuclear arsenal, a no-first-use pledge, withdrawing US tactical nuclear weapons from Europe, and ending extended nuclear deterrence for allies. The weakest part of his argument eschews nuclear retaliation against small nuclear states that attack the United States, opting instead to use only conventional weapons to guarantee regime change. He admits this will entail enormous cost and sacrifice, but cites the “immorality” of retaliating against a smaller power with few targets worthy of nuclear weaponry, which totally ignores the massive underground facilities constructed to shield military facilities in many of these states. Despite this, Nichols's thoughtful approach to post-Cold War deterrence deserves thoughtful consideration. 相似文献
72.
We introduce a generalized orienteering problem (OP) where, as usual, a vehicle is routed from a prescribed start node, through a directed network, to a prescribed destination node, collecting rewards at each node visited, to maximize the total reward along the path. In our generalization, transit on arcs in the network and reward collection at nodes both consume a variable amount of the same limited resource. We exploit this resource trade‐off through a specialized branch‐and‐bound algorithm that relies on partial path relaxation problems that often yield tight bounds and lead to substantial pruning in the enumeration tree. We present the smuggler search problem (SSP) as an important real‐world application of our generalized OP. Numerical results show that our algorithm applied to the SSP outperforms standard mixed‐integer nonlinear programming solvers for moderate to large problem instances. We demonstrate model enhancements that allow practitioners to represent realistic search planning scenarios by accounting for multiple heterogeneous searchers and complex smuggler motion. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
73.
74.
We consider a device that deteriorates over time according to a Markov process so that the failure rate at each state is constant. The reliability of the device is characterized by a Markov renewal equation, and an IFRA (increasing failure rate on average) property of the lifetime is obtained. The optimal replacement and repair problems are analyzed under various cost structures. Furthermore, intuitive and counterintuitive characterizations of the optimal policies and results on some interesting special problems are presented. © 1992 John Wiley & Sons, Inc. 相似文献
75.
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. 相似文献
76.
O. Zeynep Akşin 《海军后勤学研究》2007,54(2):221-235
This paper derives optimal policies for when to hire, train, and lay off employees in service organizations when worker productivity appreciates deterministically or stochastically under constant, monotonic, and cyclic service demand. The model, an extension of the machine replacement problem from the engineering economy literature, uses infinite horizon linear programming to produce optimal personnel planning strategies and dual prices that characterize the workforce's economic value. The effect of employee attrition is also considered. In its valuation of human assets, unlike pure accounting approaches that only try to measure, this paper proposes an approach to capture the interaction between firm decisions pertaining to human resources and human resource value. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
77.
In this paper we investigate the collection depots location problem on a network. A facility needs to be located to serve a set of customers. Each service consists of a trip to the customer, collecting materials, dropping the materials at one of the available collection depots and returning to the facility to wait for the next call. Two objectives are considered: minimizing the weighted sum of distances and minimizing the maximum distance. The properties of the solutions to these problems are described. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 15–24, 2002; DOI 10.1002/nav.10000 相似文献
78.
In this article we investigate the problem of locating a facility among a given set of demand points when the weights associated with each demand point change in time in a known way. It is assumed that the location of the facility can be changed one or more times during the time horizon. We need to find the time “breaks” when the location of the facility is to be changed, and the location of the facility during each time segment between breaks. We investigate the minisum Weber problem and also minimax facility location. For the former we show how to calculate the objective function for given time breaks and optimally solve the rectilinear distance problem with one time break and linear change of weights over time. Location of multiple time breaks is also discussed. For minimax location problems we devise two algorithms that solve the problem optimally for any number of time breaks and any distance metric. These algorithms are also applicable to network location problems. 相似文献
79.
Justin O. Smith 《Small Wars & Insurgencies》2013,24(3):448-466
A comprehensive maritime interdiction strategy to attack the insurgent's logistic system was a key element in the defeat of the Tamil Tigers. The campaign of maritime interdiction required the Sri Lankan Navy (SLN) to attack LTTE arms smuggling, sea piracy, and maritime terrorism. The SLN degraded the insurgency's robust maritime logistical network while also devising tactics to engage the maritime insurgents who reacted with swarm and suicide boat tactics. The efforts of the SLN forced the Tamil Tigers to confront the government's final land offensives with diminished resources, thus collapsing a three decades’ old insurgency in a matter of months. 相似文献
80.
In this article we develop a class of general knapsack problems which are hard for branch and bound algorithms. The number of alternate optimal solutions for these problems grows exponentially with problem parameters. In addition the LP bound is shown to be ineffective. Computational tests indicate that these problems are truly difficult for even very small problems. Implications for the testing of algorithms using randomly generated problems is discussed. 相似文献