全文获取类型
收费全文 | 533篇 |
免费 | 0篇 |
专业分类
533篇 |
出版年
2021年 | 11篇 |
2019年 | 23篇 |
2018年 | 13篇 |
2017年 | 11篇 |
2016年 | 16篇 |
2015年 | 13篇 |
2014年 | 13篇 |
2013年 | 106篇 |
2011年 | 4篇 |
2009年 | 8篇 |
2008年 | 5篇 |
2007年 | 5篇 |
2006年 | 6篇 |
2005年 | 10篇 |
2004年 | 9篇 |
2003年 | 6篇 |
2002年 | 6篇 |
2001年 | 4篇 |
2000年 | 8篇 |
1999年 | 5篇 |
1998年 | 8篇 |
1997年 | 15篇 |
1996年 | 7篇 |
1994年 | 10篇 |
1992年 | 5篇 |
1991年 | 13篇 |
1990年 | 4篇 |
1989年 | 7篇 |
1988年 | 8篇 |
1987年 | 14篇 |
1986年 | 8篇 |
1985年 | 6篇 |
1984年 | 6篇 |
1983年 | 8篇 |
1982年 | 8篇 |
1981年 | 5篇 |
1980年 | 7篇 |
1979年 | 11篇 |
1978年 | 7篇 |
1977年 | 8篇 |
1976年 | 7篇 |
1975年 | 7篇 |
1974年 | 7篇 |
1973年 | 12篇 |
1972年 | 6篇 |
1971年 | 6篇 |
1970年 | 7篇 |
1969年 | 7篇 |
1968年 | 5篇 |
1967年 | 5篇 |
排序方式: 共有533条查询结果,搜索用时 0 毫秒
161.
Results of Geoffrion for efficient and properly efficient solutions of multiobjective programming problems are extended to multiobjective fractional programming problems. Duality relationships are given for these problems where the functions are generalized convex or invex. 相似文献
162.
Without restricting the class of permissible schedules, we derive optimal schedules for economic lot scheduling problems that are fully loaded, have external setups, and have only two products. The fully loaded condition accurately represents certain types of bottlenecks. We show that the optimal schedule must have the Wagner-Whitin property. We also develop a measure of aggregate inventory, derive an optimal steady-state aggregate inventory policy, and provide conditions under which the aggregate inventory level of an optimal schedule must approach a steady state. By restricting the class of permissible schedules to rotation cycle schedules, we extend these results to more than two products. 相似文献
163.
In planar location problems with barriers one considers regions which are forbidden for the siting of new facilities as well as for trespassing. These problems are important since they model various actual applications. The resulting mathematical models have a nonconvex objective function and are therefore difficult to tackle using standard methods of location theory even in the case of simple barrier shapes and distance functions. For the case of center objectives with barrier distances obtained from the rectilinear or Manhattan metric, it is shown that the problem can be solved in polynomial time by identifying a dominating set. The resulting genuinely polynomial algorithm can be combined with bound computations which are derived from solving closely connected restricted location and network location problems. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 647–665, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10038 相似文献
164.
Jonathan Krause Thomas S. Wilkins Christopher Baxter P.M.H. Bell Vincent Boutet-Lehouillier Malcolm Hugh Patterson 《战略研究杂志》2013,36(1):145-158
Iain McCallum, Blood Brothers Hiram and Hudson Maxim: Pioneers of Modern Warfare. London: Chatham, 1999. Pp. 224, 33 illus., 2 maps, biblio., index. £20. ISBN 1–86176–096–5. Eric Ash, Sir Frederick Sykes and the Air Revolution, 1912–1918. London and Portland, OR: Frank Cass, 1999. Pp.xviii + 268, 20 illus., 3 maps, biblio., index. £42.50/$59.50 (cloth), £18.50/$27.50 (paper). ISBN 0–7146–4828–0 and ‐4382–3. Azar Gat, Fascist and Liberal Visions of War: Fuller, Liddell Hart, Douhet, and other Modernists. Oxford: Clarendon Press, 1998. Ppviii + 334, biblio., index. £45. ISBN 0–19–820715–8. David B. Woolner (ed.), The Second Quebec Conference Revisited: Waging War, Formulating Peace: Canada, Great Britain, and the United States in 1944–1945. Basingstoke; London: Macmillan Press, 1998. Pp.xiii + 210, index. £32.50. ISBN 0–333–75970–2. Jeffrey Grey. Up Top: The Royal Australian Navy and Southeast Asian Conflicts 1955–1972. St Leonards NSW: Allen &; Unwin in association with the Australian War Memorial, 1998. Pp.xx + 380, 110 illus., 12 tables, 23 maps &; diagrams, appendices, notes, biblio., index. NP. ISBN 1–86448–290–7. Susan L Carruthers, The Media at War. Basingstoke: Macmillan, 2000. Pp.321, biblio., index. £14.99 (paper). ISBN 0–333–69143–1, also available in hardback. Edward J. Marolda and Robert J. Schneller Jr, Shield and Sword: The United States Navy and the Persian Gulf War. Washington DC: Naval Historical Center, 1998. Pp.xxi + 517, 120 illus., 14 maps, biblio., index. NP. ISBN 0–1604–9476–1. Marvin Pokrant, Desert Shield at Sea: What the Navy Really Did and Desert Storm at Sea: What the Navy Really Did. Both Westport, CT: Greenwood Press, 1999. Pp.xxiii + 265,9 illus., biblio., index. £44.95. ISBN 0–313–31023–8. Pp.xxiv + 329,12 illus., biblio., index. NP. ISBN 0–313–31024–6. David Kaularich and Ronald C. Kramer, Crimes of the American Nuclear State: At Home and Abroad. Boston: Northeastern University Press, 1999. Pp.xviii + 195, biblio., index. £42.75. ISBN 1–55553–371‐X. Stanley Hoffmann, World Disorders: Troubled Peace in the Post‐Cold War Era. Lanham, MD: Rowman &; Littlefield, 1998. Pp.viii+279, notes, index. $29.95. ISBN 0–8476–8574–8. Lawrence Freedman (ed.), Strategic Coercion: Concepts and Cases. Oxford: Oxford‐University Press, 1998. Pp.400, index. £48. ISBN 0–19–829–349–6. Stephen J. Cimbala, Coercive Military Strategy. College Station, TX: Texas A&;M University Press, 1998. Pp.229, biblio, index; $39.95. ISBN 0–89096–836–5 相似文献
165.
Colin M. Fleming 《战略研究杂志》2013,36(2):213-241
Over the last 18 years or so, much of the debate about modern warfare has been about whether it should be described as ‘old’ or ‘new’. However, there has not been a definitive answer as to which best reflects war in the modern world. Increasingly, the alternative arguments are polarised into opposing camps. Indeed, it would be fair to say that there is little in the way of debate at all. By revaluating the strengths and weaknesses of each argument, this paper aims to reinvigorate that discussion by examining whether changes in the way we understand war are really required. Finding that the ideas are not in fact mutually exclusive, it suggests that future research could benefit from a combined approach. 相似文献
166.
167.
168.
169.
170.