全文获取类型
收费全文 | 195篇 |
免费 | 6篇 |
出版年
2021年 | 8篇 |
2019年 | 3篇 |
2018年 | 4篇 |
2017年 | 2篇 |
2016年 | 3篇 |
2014年 | 4篇 |
2013年 | 26篇 |
2012年 | 2篇 |
2010年 | 2篇 |
2009年 | 7篇 |
2007年 | 5篇 |
2006年 | 2篇 |
2005年 | 2篇 |
2004年 | 5篇 |
2003年 | 2篇 |
2002年 | 7篇 |
2001年 | 5篇 |
2000年 | 4篇 |
1999年 | 2篇 |
1998年 | 3篇 |
1997年 | 3篇 |
1996年 | 2篇 |
1995年 | 7篇 |
1994年 | 2篇 |
1993年 | 3篇 |
1992年 | 3篇 |
1991年 | 5篇 |
1990年 | 4篇 |
1989年 | 5篇 |
1988年 | 6篇 |
1987年 | 6篇 |
1986年 | 5篇 |
1984年 | 5篇 |
1983年 | 3篇 |
1982年 | 1篇 |
1981年 | 4篇 |
1980年 | 3篇 |
1979年 | 3篇 |
1978年 | 4篇 |
1977年 | 5篇 |
1976年 | 1篇 |
1975年 | 2篇 |
1974年 | 2篇 |
1973年 | 4篇 |
1972年 | 2篇 |
1971年 | 2篇 |
1970年 | 2篇 |
1969年 | 3篇 |
1968年 | 2篇 |
1948年 | 1篇 |
排序方式: 共有201条查询结果,搜索用时 15 毫秒
121.
This article presents a flexible days‐on and days‐off scheduling problem and develops an exact branch and price (B&P) algorithm to find solutions. The main objective is to minimize the size of the total workforce required to cover time‐varying demand over a planning horizon that may extend up to 12 weeks. A new aspect of the problem is the general restriction that the number of consecutive days on and the number of consecutive days off must each fall within a predefined range. Moreover, the total assignment of working days in the planning horizon cannot exceed some maximum value. In the B&P framework, the master problem is stated as a set covering‐type problem whose columns are generated iteratively by solving one of three different subproblems. The first is an implicit model, the second is a resource constrained shortest path problem, and the third is a dynamic program. Computational experiments using both real‐word and randomly generated data show that workforce reductions up to 66% are possible with highly flexible days‐on and days‐off patterns. When evaluating the performance of the three subproblems, it was found that each yielded equivalent solutions but the dynamic program proved to be significantly more efficient. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 678–701, 2013 相似文献
122.
James K. Wither 《Small Wars & Insurgencies》2013,24(3-4):611-635
This article examines British Army operations in Iraq. It focuses on the causes of the army's apparent failure to live up to its reputation for the conduct of small wars. The paper discusses the British experience of small wars in the context of Iraq, the influence of doctrine and strategy, and the political and moral factors that shaped the army's performance. The paper's conclusions suggest that the Iraq War may cause a significant reappraisal, not just of military doctrine and strategy, but also of Britain's role in future small wars. 相似文献
123.
A. S. Andreou K. E. Parsopoulos M. N. Vrahatis G. A. Zombanakis 《Defence and Peace Economics》2013,24(4):329-347
The aim of this paper is to indicate the extent to which the arms race against Turkey, in which Greece and Cyprus have been entangled, imposes a defence expenditure burden that is tough for the two allies to bear. To do so we have resorted to evaluating the optimal military expenditure for the two countries, allied in the context of the Integrated Defence Doctrine, which is compatible with the constraints imposed by the resources of their economies. All experiments and scenarios examined lead to the conclusion that the current defence burden of the two allies seems to be driving their economies beyond capacity limits. The fact remains, however, that under the circumstances, a one-sided disarmament policy like the one currently followed by Greece, is a risky choice given that the long-term armament programmes pursued by Turkey, whose role in this arms race has been proven as leading, leave very small room to the Greek and Cypriot sides to reduce their own defence expenditure. 相似文献
124.
125.
Loch K. Johnson ? 《The Nonproliferation Review》2013,20(1):111-118
Spying on the Nuclear Bear: Anglo-American Intelligence and the Soviet Bomb, by Michael S. Goodman. Stanford University Press, 2007. 295 pages, $50. 相似文献
126.
For nonnegative integers d1, d2, and L(d1, d2)‐labeling of a graph G, is a function f : V(G) → {0, 1, 2, …} such that |f(u) − f(v)| ≥ di whenever the distance between u and v is i in G, for i = 1, 2. The L(d1, d2)‐number of G, λ(G) is the smallest k such that there exists an L(d1, d2)‐labeling with the largest label k. These labelings have an application to a computer code assignment problem. The task is to assign integer “control codes” to a network of computer stations with distance restrictions, which allow d1 ≤ d2. In this article, we will study the labelings with (d1, d2) ∈ {(0, 1), (1, 1), (1, 2)}. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
127.
128.
129.
Charles H. Reilly Clark A. Mount-Campbell Fernando Mata Eric K. Walton Eric A. Aebker Curt A. Levis 《海军后勤学研究》1991,38(6):779-797
We consider the problem of allotting locations in the geostationary orbit to communication satellites, subject to angle of elevation and electromagnetic interference constraints. An optimization framework is used as a means of finding feasible allotment plans. Specifically, we present a two-phase solution procedure for the satellite location problem (SLP). The objective in SLP is to allot geostationary orbital locations to satellites so as to minimize the sum of the absolute differences between the locations prescribed for the satellites and corresponding specified desired locations. We describe two heuristics, an ordering procedure and a k-permutation algorithm, that are used in tandem to find solutions to SLP. Solutions to a worldwide example problem with 183 satellites serving 208 service areas are summarized. 相似文献
130.
K. H. Wickwire 《海军后勤学研究》1981,28(3):423-429
We investigate a class of optimal stopping problems for dynamical systems described by one-dimensional differential equations with an additive Poisson disturbance. The rate of the disturbance may depend upon the current state of the system. A dynamic programming equation for the optimal stopping cost is derived along with conditions which must be met at the boundary of the optimal stopping set. These boundary conditions depend upon whether or not the stopping set may be entered by smooth motion. 相似文献