全文获取类型
收费全文 | 106篇 |
免费 | 2篇 |
出版年
2021年 | 1篇 |
2019年 | 4篇 |
2018年 | 5篇 |
2017年 | 8篇 |
2016年 | 4篇 |
2014年 | 2篇 |
2013年 | 22篇 |
2012年 | 2篇 |
2011年 | 2篇 |
2010年 | 2篇 |
2009年 | 3篇 |
2007年 | 1篇 |
2006年 | 2篇 |
2005年 | 2篇 |
2004年 | 3篇 |
2003年 | 1篇 |
2002年 | 5篇 |
2000年 | 3篇 |
1998年 | 2篇 |
1995年 | 1篇 |
1993年 | 4篇 |
1992年 | 1篇 |
1991年 | 2篇 |
1987年 | 1篇 |
1985年 | 3篇 |
1984年 | 2篇 |
1983年 | 2篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1979年 | 1篇 |
1976年 | 1篇 |
1975年 | 3篇 |
1974年 | 2篇 |
1973年 | 2篇 |
1972年 | 1篇 |
1971年 | 3篇 |
1969年 | 1篇 |
1968年 | 1篇 |
排序方式: 共有108条查询结果,搜索用时 55 毫秒
91.
The gradual covering problem 总被引:1,自引:0,他引:1
In this paper we investigate the gradual covering problem. Within a certain distance from the facility the demand point is fully covered, and beyond another specified distance the demand point is not covered. Between these two given distances the coverage is linear in the distance from the facility. This formulation can be converted to the Weber problem by imposing a special structure on its cost function. The cost is zero (negligible) up to a certain minimum distance, and it is a constant beyond a certain maximum distance. Between these two extreme distances the cost is linear in the distance. The problem is analyzed and a branch and bound procedure is proposed for its solution. Computational results are presented. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
92.
Consider n jobs (J1, …, Jn), m working stations (M1, …, Mm) and λ linear resources (R1, …, Rλ). Job Ji consists of m operations (Oi1, …, Oim). Operation Oij requires Pk(i, j) units of resource Rk to be realized in an Mj. The availability of resource Rk and the ability of the working station Mh to consume resource Rk, vary over time. An operation involving more than one resource consumes them in constant proportions equal to those in which they are required. The order in which operations are realized is immaterial. We seek an allocation of the resources such that the schedule length is minimized. In this paper, polynomial algorithms are developed for several problems, while NP-hardness is demonstrated for several others. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 51–66, 1998 相似文献
93.
It is shown that two recent results of Baxter and Harche [1] on monotone and balanced optimal assemblies hold only under conditions that are more restrictive than those originally proposed by the authors. We describe such additional conditions, illustrate why they are needed, and establish their sufficiency. We also consider a recent result by Malon [11] and demonstrate that, while the result itself is correct, its two proofs were incomplete. A complete proof of an extension of the result is then suggested. © 1995 John Wiley & Sons, Inc. 相似文献
94.
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. 相似文献
95.
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. 相似文献
96.
97.
98.
Frank O’Donnell 《The Nonproliferation Review》2019,26(5-6):407-426
ABSTRACTThe India–Pakistan near war of February–March 2019 highlights India’s ongoing evolution in strategic thought and practice since its emergence in 1998 as an overt nuclear-weapon possessor. These changes, involving an increasing willingness to engage in the intentional escalation of conflict with a nuclear-armed rival willing to be the first to use nuclear weapons, challenge certain academic assumptions about the behavior of nuclear-weapon states. In particular, they undermine the expectations of the nuclear-revolution theory—which anticipates nuclear and conventional restraint among nuclear-armed rivals through fear of mutual assured destruction—and the model of nuclear learning which underpins this theory, in which new nuclear-weapon states gradually absorb this restraint through policy-maker learning. This article explores how India’s learning pathway since 1998 has deviated from these expectations. India is instead pursuing its own “revolution,” in the direction of creating capabilities for flexible response and escalation dominance. It concludes by illuminating the similarities between Indian strategic behavior and contemporary practices of other nuclear-armed states, and suggests that New Delhi’s emerging de facto nuclear doctrine and posture is part of a broader empirical challenge to our current conceptions of the nuclear revolution and of nuclear learning. 相似文献
99.
This article studies two due window scheduling problems to minimize the weighted number of early and tardy jobs in a two‐machine flow shop, where the window size is externally determined. These new scheduling models have many practical applications in real life. However, results on these problems have rarely appeared in the literature because of a lack of structural and optimality properties for solving them. In this article, we derive several dominance properties and theorems, including elimination rules and sequencing rules based on Johnsos order, lower bounds on the penalty, and upper bounds on the window location, which help to significantly trim the search space for the problems. We further show that the problems are NP‐hard in the ordinary sense only. We finally develop efficient pseudopolynomial dynamic programming algorithms for solving the problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
100.
Mai’a K. Davis Cross 《Contemporary Security Policy》2016,37(3):402-413
The new EU Global Strategy has significant implications for EU diplomacy, in terms of both goals and means. This article first analyses the timing of the strategy as an exercise in diplomacy in its own right. Second, it argues that the strategy outlines a more expansive and noticeably more smart power-oriented approach to diplomacy in practical terms. Finally, it notes that the strategy has a new meta-narrative for EU diplomacy, which seeks to project a blend of both realistic assessment and idealistic aspiration. 相似文献