全文获取类型
收费全文 | 426篇 |
免费 | 18篇 |
国内免费 | 1篇 |
出版年
2021年 | 6篇 |
2019年 | 12篇 |
2018年 | 13篇 |
2017年 | 8篇 |
2016年 | 9篇 |
2015年 | 7篇 |
2014年 | 10篇 |
2013年 | 98篇 |
2012年 | 5篇 |
2011年 | 5篇 |
2010年 | 5篇 |
2009年 | 4篇 |
2008年 | 5篇 |
2007年 | 4篇 |
2006年 | 8篇 |
2005年 | 7篇 |
2004年 | 5篇 |
2003年 | 6篇 |
2002年 | 4篇 |
2000年 | 3篇 |
1998年 | 4篇 |
1997年 | 6篇 |
1996年 | 8篇 |
1995年 | 5篇 |
1994年 | 7篇 |
1993年 | 11篇 |
1992年 | 8篇 |
1991年 | 8篇 |
1989年 | 10篇 |
1988年 | 7篇 |
1987年 | 6篇 |
1986年 | 7篇 |
1985年 | 10篇 |
1984年 | 8篇 |
1983年 | 4篇 |
1982年 | 6篇 |
1981年 | 4篇 |
1980年 | 9篇 |
1979年 | 7篇 |
1978年 | 8篇 |
1976年 | 8篇 |
1975年 | 10篇 |
1974年 | 8篇 |
1973年 | 11篇 |
1972年 | 6篇 |
1971年 | 4篇 |
1970年 | 6篇 |
1969年 | 5篇 |
1968年 | 5篇 |
1967年 | 3篇 |
排序方式: 共有445条查询结果,搜索用时 31 毫秒
391.
R.T. Stearn Editor John T. Fishel Paul Y. Hammond Thomas R. Mockaitis 《Small Wars & Insurgencies》2013,24(3):426-434
Ian Castle and Ian Knight, Fearful Hard Times: The Siege and Relief of Eshowe, 1879. Greenhill Books, London 1994, Pp.256, 85 illus, 6 maps, index. £17.95. ISBN 1–85367–180–0. Michael E. Brown (ed.), Ethnic Conflict and International Security. Princeton: Princeton University Press, 1993, Pp.263, selected biblio, index. $45/£30 (cloth); $14.95/£12.95 (paper). ISBN 0–691–03368 and 00068–9. Deborah Poole and Gerardo Renique, Peru: Time of Fear. London: Latin American Bureau (Research and Action) Ltd., 1992. Pp.212, 7 maps, photographs, glossary, sources/further reading, index. £17.99 ISBN 0–906156–70‐X and ‐71–8. David A. Charters (ed.), Peacekeeping and the Challenge of Civil Conflict Resolution. Center for Conflict Studies, University of New Brunswick, 1994. Pp.viii+220. NP. Joachim Remak, A Very Civil War: The Swiss Sonderbund War of 1847. Boulder, Colorado: Westview Press, 1993. Pp.xvi+221, 6 map's, 68 illus, biblio, index. $24.95/£16.95. 相似文献
392.
Thomas R. Mockaitis Max G. Manwaring Daniel W. Fitz‐Simons Richard Holmes 《Small Wars & Insurgencies》2013,24(2):254-260
Norman Cigar, Genocide in Bosnia: The Policy of “Ethnic Cleansing”. College Station, Texas: Texas A&M University Press, 1995. Pp.xiv + 247; app., map, notes, cartoon. Maria Jose Moyano, Argentina's Lost Patrol: Armed Struggle, 1969–1979. New Haven: Connecticut Yale University Press, 1995. Pp.xiii + 226, biblio., abbreviations, 10 figures, 1 map, tables, index; $25/£16.95. ISBN 0–300–01622–6. Donald E. Schulz and Deborah Sundloff Schulz, The United States, Honduras, and the Crisis in Central America, Westview Thematic Studies in Latin America, Boulder, Co: Westview, 1994. Pp.368, map, figure, select biblio., abbreviations, index. $52.50/£37.50; (cloth) $17.95/£11.95 (paper). ISBN 0–8133–1324–4 and 1323–6. Joseph H. Alexander and Merrill L. Bartlett, Sea Soldiers in the Cold War: Amphibious Warfare 1945–1991. Annapolis, Maryland: Naval Institute Press, 1995. Pp.iii + 178, 1 map, 29 illus, biblio, index. $32.95. ISBN Gary P. Cox, The Halt in the Mud: French Strategic Planning from Waterloo to Sedan. Westview Press, 1994. Pp.258, maps, notes, biblio, index. £33.50. ISBN 0–133–1536–0. 相似文献
393.
J. Thomas Moriarty 《Small Wars & Insurgencies》2013,24(3):476-497
The purpose of this paper is to provide a better conceptualization of insurgent strategies. Specifically, I shall examine Che Guevara's ‘Foco’ theory of insurgency, as it is one of the most theoretically popular and most pervasive strategies of insurgency currently practiced throughout the world. After briefly examining the origins, objectives, and theoretical strengths of the Foco theory (also known as the Vanguard Theory), I will argue that Guevara's theory suffers from an internal tension that I term the ‘Vanguard's Dilemma’. The significance of this dilemma creates a tension within the Vanguard Theory that can be fatal for insurgents if properly exploited by counterinsurgent operations. This paper will examine in detail this dilemma and show how it can be exploited. Given that several insurgent groups within Iraq and Afghanistan currently adhere to the Vanguard Theory of insurgency, a proper understanding of this insurgent strategy is an essential first step in the long road towards confronting and winning asymmetrical conflicts. 相似文献
394.
395.
396.
We study new models of scheduled maintenance management for modular systems, consisting of multiple components with respective cycle limits. The cycle limit of each component specifies the time interval in which this component must be repaired or replaced. The goal is to compute a feasible maintenance schedule that minimizes the cost associated with component maintenance. Applications of these models arise in Air Force aircraft maintenance as well as in other arenas with required preventive maintenance. The typical cost structures that arise in practical settings are submodular, which make the resulting models computationally challenging. We develop two efficient and operationally tenable approximation algorithms. We prove constant factor worst‐case guarantees for both algorithms, and present computational experiments showing that these algorithms perform within a few percent of optimality on operationally relevant instances. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 472–488, 2014 相似文献
397.
This article introduces the twin robots scheduling problem (TRSP), in which two robots positioned at the opposite ends of a rail are required to deliver items to positions along the rail, and the objective is to minimize the makespan. A proof of ‐hardness of the TRSP is presented, along with exact and heuristic algorithms. Computational results on challenging instances are provided.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 119–130, 2014 相似文献
398.
We consider a class of facility location problems with a time dimension, which requires assigning every customer to a supply facility in each of a finite number of periods. Each facility must meet all assigned customer demand in every period at a minimum cost via its production and inventory decisions. We provide exact branch‐and‐price algorithms for this class of problems and several important variants. The corresponding pricing problem takes the form of an interesting class of production planning and order selection problems. This problem class requires selecting a set of orders that maximizes profit, defined as the revenue from selected orders minus production‐planning‐related costs incurred in fulfilling the selected orders. We provide polynomial‐time dynamic programming algorithms for this class of pricing problems, as well as for generalizations thereof. Computational testing indicates the advantage of our branch‐and‐price algorithm over various approaches that use commercial software packages. These tests also highlight the significant cost savings possible from integrating location with production and inventory decisions and demonstrate that the problem is rather insensitive to forecast errors associated with the demand streams. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
399.
Decentralized decision‐making in supply chain management is quite common, and often inevitable, due to the magnitude of the chain, its geographical dispersion, and the number of agents that play a role in it. But, decentralized decision‐making is known to result in inefficient Nash equilibrium outcomes, and optimal outcomes that maximize the sum of the utilities of all agents need not be Nash equilibria. In this paper we demonstrate through several examples of supply chain models how linear reward/penalty schemes can be implemented so that a given optimal solution becomes a Nash equilibrium. The examples represent both vertical and horizontal coordination issues. The techniques we employ build on a general framework for the use of linear reward/penalty schemes to induce stability in given optimal solutions and should be useful to other multi‐agent operations management settings. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
400.
The reoptimization procedure within the shifting bottleneck (SB) involves reevaluation of all previously scheduled toolgroup subproblems at each iteration of the SB heuristic. A real options analysis (ROA) model is developed to value the option to reoptimize in the SB heuristic, such that reoptimization only occurs when it is most likely to lead to a schedule with a lower objective function. To date, all ROA models have sought to value options financially (i.e., in terms of monetary value). The ROA model developed in this paper is completely original in that it has absolutely no monetary basis. The ROA methodologies presented are shown to greatly outperform both full and no reoptimization approaches with respect to both computation time and total weighted tardiness. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献