全文获取类型
收费全文 | 824篇 |
免费 | 22篇 |
出版年
2021年 | 9篇 |
2019年 | 18篇 |
2018年 | 12篇 |
2017年 | 17篇 |
2016年 | 16篇 |
2015年 | 17篇 |
2014年 | 8篇 |
2013年 | 141篇 |
2011年 | 8篇 |
2010年 | 8篇 |
2009年 | 8篇 |
2007年 | 12篇 |
2006年 | 9篇 |
2005年 | 14篇 |
2004年 | 15篇 |
2003年 | 9篇 |
2001年 | 11篇 |
2000年 | 12篇 |
1999年 | 12篇 |
1998年 | 13篇 |
1997年 | 18篇 |
1996年 | 18篇 |
1995年 | 15篇 |
1994年 | 21篇 |
1993年 | 15篇 |
1992年 | 18篇 |
1991年 | 24篇 |
1990年 | 13篇 |
1989年 | 15篇 |
1988年 | 13篇 |
1987年 | 17篇 |
1986年 | 11篇 |
1985年 | 17篇 |
1984年 | 16篇 |
1983年 | 13篇 |
1982年 | 11篇 |
1981年 | 16篇 |
1980年 | 16篇 |
1979年 | 17篇 |
1978年 | 13篇 |
1977年 | 12篇 |
1976年 | 14篇 |
1975年 | 14篇 |
1974年 | 17篇 |
1973年 | 13篇 |
1972年 | 17篇 |
1971年 | 17篇 |
1969年 | 8篇 |
1968年 | 10篇 |
1967年 | 7篇 |
排序方式: 共有846条查询结果,搜索用时 15 毫秒
91.
Today, few countries fight alone; most fight as allies or partners in multilateral campaigns. The end of the Cold War opened a window of opportunity for multinational military operations (MMOs). These have seen varying degrees of participation, enthusiasm, and success. This special forum is devoted to the politics of multilateral warfare including their formation, maintenance, and durability. The introduction sketches past research and derives some key questions of continuing relevance. The contributions shed light on the domestic and international politics of MMOs, focusing on the implementation of national restrictions and their repercussions for MMOs, party politics of military intervention, the conditions under which states decide to defect from military operations, and the role of junior partners in MMOs. In sum, this forum offers a fresh look at the politics of MMOs, including conceptual contributions to the study of national restrictions, domestic constraints, and coalition warfare. 相似文献
92.
Patrick A. Mello 《Contemporary Security Policy》2019,40(1):38-55
Recent scholarship in security studies has started to explore the causes and consequences of various forms of national restrictions in multinational military operations (MMOs). This article makes a conceptual contribution to this literature by developing a theoretical framework of national restrictions in MMOs that distinguishes between structural, procedural, and operational restrictions. I argue that these types of restrictions are governed by different causal mechanisms. Structural restrictions are relatively stable over time and effect deployment decisions irrespective of other factors. Procedural restrictions, on the other hand, can constitute veto points against deployment only in combination with distinct political preferences. Finally, operational restrictions directly affect the rules of engagement of troop contributing countries. The article illustrates the three types of restrictions and their interaction with empirical examples from a range of countries and sketches their impact on MMO deployment decisions and mandates. 相似文献
93.
In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
94.
A. W. Kemp 《海军后勤学研究》1987,34(6):853-858
The article examines ways of computing cumulative probabilities for a constrained Poissonian binomial distribution arising from a model of a weapon defense system. 相似文献
95.
This article introduces the use of Benders' cuts to guide a large neighborhood search to solve the traveling umpire problem, a sports scheduling problem inspired by the real‐life needs of the officials of a sports league. At each time slot, a greedy matching heuristic is used to construct a schedule. When an infeasibility is recognized first a single step backtracking is tried to resolve the infeasibility. If unsuccessful, Benders' cuts are generated to guide a large neighborhood search to ensure feasibility and to improve the solution. Realizing the inherent symmetry present in the problem, a large family of cuts are generated and their effectiveness is tested. The resulting approach is able to find better solutions to many instances of this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
96.
In this article, we consider the concurrent open shop scheduling problem to minimize the total weighted completion time. When the number of machines is arbitrary, the problem has been shown to be inapproximable within a factor of 4/3 ‐ ε for any ε > 0 if the unique games conjecture is true in the literature. We propose a polynomial time approximation scheme for the problem under the restriction that the number of machines is fixed. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
97.
A. Garnaev 《海军后勤学研究》2007,54(1):109-114
This paper deals with a two searchers game and it investigates the problem of how the possibility of finding a hidden object simultaneously by players influences their behavior. Namely, we consider the following two‐sided allocation non‐zero‐sum game on an integer interval [1,n]. Two teams (Player 1 and 2) want to find an immobile object (say, a treasure) hidden at one of n points. Each point i ∈ [1,n] is characterized by a detection parameter λi (μi) for Player 1 (Player 2) such that pi(1 ? exp(?λixi)) (pi(1 ? exp(?μiyi))) is the probability that Player 1 (Player 2) discovers the hidden object with amount of search effort xi (yi) applied at point i where pi ∈ (0,1) is the probability that the object is hidden at point i. Player 1 (Player 2) undertakes the search by allocating the total amount of effort X(Y). The payoff for Player 1 (Player 2) is 1 if he detects the object but his opponent does not. If both players detect the object they can share it proportionally and even can pay some share to an umpire who takes care that the players do not cheat each other, namely Player 1 gets q1 and Player 2 gets q2 where q1 + q2 ≤ 1. The Nash equilibrium of this game is found and numerical examples are given. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
98.
We study a component inventory planning problem in an assemble‐to‐order environment faced by many contract manufacturers in which both quick delivery and efficient management of component inventory are crucial for the manufacturers to achieve profitability in a highly competitive market. Extending a recent study in a similar problem setting by the same authors, we analyze an optimization model for determining the optimal component stocking decision for a contract manufacturer facing an uncertain future demand, where product price depends on the delivery times. In contrast to our earlier work, this paper considers the situation where the contract manufacturer needs to deliver the full order quantity in one single shipment. This delivery requirement is appropriate for many industries, such as the garment and toy industries, where the economies of scale in transportation is essential. We develop efficient solution procedures for solving this optimization problem. We use our model results to illustrate how the different model parameters affect the optimal solution. We also compare the results under this full‐shipment model with those from our earlier work that allows for multiple partial shipments. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
99.
100.
Thomas A. Marks 《Small Wars & Insurgencies》2017,28(1):81-118
During the period 1996–2006, the Communist Party of Nepal (Maoist) waged overt people’s war to seize state power and institute a new order that realized the party’s understanding of ‘New Democracy’ as posited by Mao Tse-tung. Contextual shifts led to a crucial strategic turning point in September 2005, when the Maoists agreed to a united front with estranged legal parties to oust the monarchy and establish a republic. Though touted as acceptance of political reintegration, the move was tactical rather than strategic. The party had no intention of supporting a parliamentary version of democracy and thus, 2006–2016, engaged in a covert effort to seize power. Central to this effort was the paramilitary Young Communist League (YCL), the members of which responded to inflammatory party verbiage and exhortations with attacks upon rival political actors. These attacks, academically and legally, were terrorism and offered a salient illustration of intra-state unrestricted warfare. Ultimately, organizational, national, and regional circumstances caused the main Maoist movement to move decisively away from its covert approach. By that time, however, radical splinters had embraced the use of terrorism against rival political actors, creating a situation whereby local politics is yet a dangerous endeavor in certain areas and at certain times. 相似文献