全文获取类型
收费全文 | 289篇 |
免费 | 12篇 |
出版年
2020年 | 3篇 |
2019年 | 14篇 |
2018年 | 9篇 |
2017年 | 5篇 |
2016年 | 10篇 |
2015年 | 8篇 |
2014年 | 9篇 |
2013年 | 92篇 |
2011年 | 8篇 |
2010年 | 3篇 |
2009年 | 4篇 |
2008年 | 4篇 |
2007年 | 7篇 |
2006年 | 2篇 |
2005年 | 7篇 |
2004年 | 3篇 |
2003年 | 4篇 |
2002年 | 4篇 |
2001年 | 3篇 |
1999年 | 5篇 |
1998年 | 4篇 |
1997年 | 6篇 |
1996年 | 4篇 |
1995年 | 3篇 |
1994年 | 7篇 |
1993年 | 3篇 |
1992年 | 5篇 |
1991年 | 3篇 |
1990年 | 3篇 |
1989年 | 4篇 |
1988年 | 5篇 |
1987年 | 6篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1983年 | 3篇 |
1981年 | 3篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1976年 | 2篇 |
1975年 | 2篇 |
1974年 | 1篇 |
1973年 | 4篇 |
1972年 | 4篇 |
1971年 | 3篇 |
1970年 | 4篇 |
1969年 | 1篇 |
1968年 | 2篇 |
1967年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有301条查询结果,搜索用时 15 毫秒
191.
192.
193.
Philip Gummett H. P. Wilmott Laurie H. Boulden Malcolm Chalmers R. G. L. von Zugbach de Sugg Mark Phythian Kate Smith 《Defense & Security Analysis》1997,13(2):225-234
Export or Die: Britain's Defence Trade with Iran and Iraq. by Davina Miller, London: Cassell, 1996, ISBN 0-304-33852-4 (hbk), £40.00, 04-33853-2 (pbk), £11.99.
The Storm Passed By: Ireland and the Battle of the Atlantic, 1940-1941. by Trevor Allen, Dublin: Irish Academic Press, 1996, ISBN 0-7165-2616-6, (hbk) £17.50.
Arms Control Toward the 21st Century. by Jeffrey A. Larsen and Greqory J. Rattray (eds). Boulder: Lynne Rienner, 1996.
Asia-Pacific Security, Less Uncertainty, New Opportunities. Edited by Gary Klintworth. Melbourne: Addison Wesley Longman, 1996, ISBN 0-582-80321-7, £24.99.
Masters of War, Military Dissent and Politics in the Vietnam Era. by Robert Buzzanco, Cambridge: Cambridge University Press, 1996, ISBN 0-521-48046-9 (hbk), £29.95
Controlling the Arms Trade: the West Versus the Rest. By Paul Cornish, London: Bowerdean Publishing Co., 1996, ISBN 0-906097-44-4 (pbk), £9.99.
Secret Agencies: US Intelligence in a Hostile World. by Loch K. Johnson, London: Yale University Press, 1997, ISBN 0-300-06611-2 (hbk), £22.50. 相似文献
The Storm Passed By: Ireland and the Battle of the Atlantic, 1940-1941. by Trevor Allen, Dublin: Irish Academic Press, 1996, ISBN 0-7165-2616-6, (hbk) £17.50.
Arms Control Toward the 21st Century. by Jeffrey A. Larsen and Greqory J. Rattray (eds). Boulder: Lynne Rienner, 1996.
Asia-Pacific Security, Less Uncertainty, New Opportunities. Edited by Gary Klintworth. Melbourne: Addison Wesley Longman, 1996, ISBN 0-582-80321-7, £24.99.
Masters of War, Military Dissent and Politics in the Vietnam Era. by Robert Buzzanco, Cambridge: Cambridge University Press, 1996, ISBN 0-521-48046-9 (hbk), £29.95
Controlling the Arms Trade: the West Versus the Rest. By Paul Cornish, London: Bowerdean Publishing Co., 1996, ISBN 0-906097-44-4 (pbk), £9.99.
Secret Agencies: US Intelligence in a Hostile World. by Loch K. Johnson, London: Yale University Press, 1997, ISBN 0-300-06611-2 (hbk), £22.50. 相似文献
194.
David P. Baron 《海军后勤学研究》1972,19(2):253-260
A program with a quadratic objective function and quadratic constraints is considered. Two duals to such programs are provided, and an algorithm is presented based upon approximations to the duals. The algorithm consists of a sequence of linear programs and programs involving the optimization of a quadratic function either unconstrained or constrained to the nonnegative orthant. An example involving production planning is presented. 相似文献
195.
David P. Baron 《海军后勤学研究》1971,18(2):169-176
The random variables in two-stage programming under uncertainty are generally treated in a passive manner in that no information regarding the random variables or the process generating the random variables may be obtained. This paper develops the economics of information for the case in which the probability distributions are discrete. A multinomial process is assumed to generate the random variables, and the parameter vector of that process is assumed to be unknown. A Dirichlet prior distribution on the parameter vector is used, and the computation of the value of information thus involves a Dirichlet-multinomial distribution on the random variables. An example involving producing to meet uncertain demands is presented. 相似文献
196.
197.
David A. Butler 《海军后勤学研究》1979,26(4):565-578
Means of measuring and ranking a system's components relative to their importance to the system reliability have been developed by a number of authors. This paper investigates a new ranking that is based upon minimal cuts and compares it with existing definitions. The new ranking is shown to be easily calculated from readily obtainable information and to be most useful for systems composed of highly reliable components. The paper also discusses extensions of importance measures and rankings to systems in which both the system and its components may be in any of a finite number of states. Many of the results about importance measures and rankings for binary systems are shown to extend to the more sophisticated multi-state systems. Also, the multi-state importance measures and rankings are shown to be decomposable into a number of sub-measures and rankings. 相似文献
198.
David P. Herron 《海军后勤学研究》1966,13(2):167-176
The iteration usually necessary for simultaneous determination of minimum-cost order quantity and reorder point in (Q, r) inventory systems may be eliminated by a graphical technique employing dimensionless ratios. This technique is illustrated for three different types of stock-out penalty. 相似文献
199.
David R. Morrison Jason J. Sauppe Wenda Zhang Sheldon H. Jacobson Edward C. Sewell 《海军后勤学研究》2017,64(1):64-82
The cyclic best‐first search (CBFS) strategy is a recent search strategy that has been successfully applied to branch‐and‐bound algorithms in a number of different settings. CBFS is a modification of best‐first search (BFS) that places search tree subproblems into contours which are collections of subproblems grouped in some way, and repeatedly cycles through all non‐empty contours, selecting one subproblem to explore from each. In this article, the theoretical properties of CBFS are analyzed for the first time. CBFS is proved to be a generalization of all other search strategies by using a contour definition that explores the same sequence of subproblems as any other search strategy. Further, a bound is proved between the number of subproblems explored by BFS and the number of children generated by CBFS, given a fixed branching strategy and set of pruning rules. Finally, a discussion of heuristic contour‐labeling functions is provided, and proof‐of‐concept computational results for mixed‐integer programming problems from the MIPLIB 2010 database are shown. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 64–82, 2017 相似文献
200.
We study a multi‐stage dynamic assignment interdiction (DAI) game in which two agents, a user and an attacker, compete in the underlying bipartite assignment graph. The user wishes to assign a set of tasks at the minimum cost, and the attacker seeks to interdict a subset of arcs to maximize the user's objective. The user assigns exactly one task per stage, and the assignment costs and interdiction impacts vary across stages. Before any stage commences in the game, the attacker can interdict arcs subject to a cardinality constraint. An interdicted arc can still be used by the user, but at an increased assignment cost. The goal is to find an optimal sequence of assignments, coupled with the attacker's optimal interdiction strategy. We prove that this problem is strongly NP‐hard, even when the attacker can interdict only one arc. We propose an exact exponential‐state dynamic‐programming algorithm for this problem as well as lower and upper bounds on the optimal objective function value. Our bounds are based on classical interdiction and robust optimization models, and on variations of the DAI game. We examine the efficiency of our algorithms and the quality of our bounds on a set of randomly generated instances. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 373–387, 2017 相似文献