全文获取类型
收费全文 | 324篇 |
免费 | 5篇 |
出版年
2021年 | 3篇 |
2019年 | 7篇 |
2018年 | 5篇 |
2017年 | 6篇 |
2016年 | 9篇 |
2015年 | 7篇 |
2014年 | 3篇 |
2013年 | 83篇 |
2011年 | 4篇 |
2008年 | 4篇 |
2007年 | 8篇 |
2006年 | 4篇 |
2005年 | 9篇 |
2004年 | 3篇 |
2003年 | 3篇 |
2002年 | 5篇 |
2001年 | 2篇 |
2000年 | 2篇 |
1999年 | 5篇 |
1997年 | 2篇 |
1996年 | 4篇 |
1995年 | 6篇 |
1994年 | 5篇 |
1993年 | 3篇 |
1992年 | 3篇 |
1991年 | 4篇 |
1990年 | 3篇 |
1989年 | 5篇 |
1988年 | 6篇 |
1987年 | 5篇 |
1986年 | 9篇 |
1985年 | 5篇 |
1983年 | 4篇 |
1982年 | 8篇 |
1980年 | 5篇 |
1979年 | 3篇 |
1978年 | 5篇 |
1977年 | 5篇 |
1976年 | 2篇 |
1975年 | 5篇 |
1974年 | 7篇 |
1973年 | 7篇 |
1972年 | 7篇 |
1971年 | 8篇 |
1970年 | 3篇 |
1969年 | 5篇 |
1968年 | 5篇 |
1967年 | 2篇 |
1966年 | 3篇 |
1948年 | 3篇 |
排序方式: 共有329条查询结果,搜索用时 241 毫秒
111.
112.
Andrew Sanders 《Small Wars & Insurgencies》2013,24(3):465-492
The role of the British Army in Northern Ireland during Operation Banner (1969–2007) is an instructive case study of counterinsurgency operations as well as an important chapter in recent British military history. Given troops deployed to the province as aid to the civil power, it is particularly useful in discussions about the principle of minimum force. This article seeks to explore the issue of minimum force through the example of Operation Motorman, the Army's successful attempt to remove the barricades, which had established so-go areas for the security forces in Northern Ireland. 相似文献
113.
114.
Andrew J. Dowdle 《Small Wars & Insurgencies》2013,24(2):161-174
Previous research on African military spending suggests the existence of civil strife as the best predictor of high levels of military spending. However, little is known about why some African nations maintain strong ‘auxiliary’ or paramilitary organizations while others do not. This study finds that the presence of civil or interstate war does not strengthen reserve or irregular forces. Civilian governments promote strong paramilitary organizations to counter any threat the regular military might pose to regime survivability as a form of clientelist politics. 相似文献
115.
Thijs W. Brocades Zaalberg 《Small Wars & Insurgencies》2013,24(4):399-420
History teaches that counterinsurgency and counterterrorism campaigns have never been won through purely military action. Defeating an opponent who avoids open battle, but who uses force to reach his goals, including terrorist action, requires a combination of police, administrative, economic and military measures. As a counterinsurgency campaign should pursue a comprehensive political objective, it requires high levels of civil–military cooperation. However, current NATO doctrine for Civil–Military Cooperation (CIMIC) as it emerged from the 1990s is founded in conventional war-fighting and outdated peacekeeping doctrine. CIMIC's focus is on supporting military objectives rather than enabling the military to make a coherent contribution to political objectives. This makes CIMIC unfit for the Alliance's main operational challenges that have expanded from peace operations on the Balkans to countering insurgent terrorism in Afghanistan. When developing CIMIC, the Alliance obviously neglected the historical lessons from counterinsurgency campaigns. 相似文献
116.
117.
In this work, we study manpower allocation with time windows and job‐teaming constraints. A set of jobs at dispersed locations requires teams of different types of workers where each job must be carried out in a preestablished time window and requires a specific length of time for completion. A job is satisfied if the required composite team can be brought together at the job's location for the required duration within the job's time window. The objective is to minimize a weighted sum of the total number of workers and the total traveling time. We show that construction heuristics used with simulated annealing is a good approach to solving this NP‐hard problem. In experiments, this approach is compared with solutions found using CPLEX and with lower bounds obtained from a network flow model. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
118.
We consider a generalization of the well‐known generalized assignment problem (GAP) over discrete time periods encompassed within a finite planning horizon. The resulting model, MultiGAP, addresses the assignment of tasks to agents within each time period, with the attendant single‐period assignment costs and agent‐capacity constraint requirements, in conjunction with transition costs arising between any two consecutive periods in which a task is reassigned to a different agent. As is the case for its single‐period antecedent, MultiGAP offers a robust tool for modeling a wide range of capacity planning problems occurring within supply chain management. We provide two formulations for MultiGAP and establish that the second (alternative) formulation provides a tighter bound. We define a Lagrangian relaxation‐based heuristic as well as a branch‐and‐bound algorithm for MultiGAP. Computational experience with the heuristic and branch‐and‐bound algorithm on over 2500 test problems is reported. The Lagrangian heuristic consistently generates high‐quality and in many cases near‐optimal solutions. The branch‐and‐bound algorithm is also seen to constitute an effective means for solving to optimality MultiGAP problems of reasonable size. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
119.
Stochastic dynamic programming models are attractive for multireservoir control problems because they allow non‐linear features to be incorporated and changes in hydrological conditions to be modeled as Markov processes. However, with the exception of the simplest cases, these models are computationally intractable because of the high dimension of the state and action spaces involved. This paper proposes a new method of determining an operating policy for a multireservoir control problem that uses stochastic dynamic programming, but is practical for systems with many reservoirs. Decomposition is first used to reduce the problem to a number of independent subproblems. Each subproblem is formulated as a low‐dimensional stochastic dynamic program and solved to determine the operating policy for one of the reservoirs in the system. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
120.
Ebru K. Bish Thin‐Yin Leong Chung‐Lun Li Jonathan W. C. Ng David Simchi‐Levi 《海军后勤学研究》2001,48(5):363-385
We consider a container terminal discharging containers from a ship and locating them in the terminal yard. Each container has a number of potential locations in the yard where it can be stored. Containers are moved from the ship to the yard using a fleet of vehicles, each of which can carry one container at a time. The problem is to assign each container to a yard location and dispatch vehicles to the containers so as to minimize the time it takes to download all the containers from the ship. We show that the problem is NP‐hard and develop a heuristic algorithm based on formulating the problem as an assignment problem. The effectiveness of the heuristic is analyzed from both worst‐case and computational points of view. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 363–385, 2001 相似文献