首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   507篇
  免费   19篇
  2019年   8篇
  2017年   9篇
  2016年   12篇
  2015年   10篇
  2014年   10篇
  2013年   112篇
  2011年   5篇
  2009年   5篇
  2008年   4篇
  2007年   6篇
  2005年   5篇
  2004年   8篇
  2003年   4篇
  2002年   6篇
  2001年   7篇
  2000年   4篇
  1999年   7篇
  1998年   11篇
  1997年   9篇
  1996年   9篇
  1995年   12篇
  1994年   12篇
  1993年   13篇
  1992年   16篇
  1991年   14篇
  1990年   8篇
  1989年   5篇
  1988年   12篇
  1987年   10篇
  1986年   5篇
  1985年   11篇
  1984年   9篇
  1983年   6篇
  1982年   6篇
  1981年   10篇
  1980年   7篇
  1979年   15篇
  1978年   7篇
  1977年   5篇
  1976年   7篇
  1975年   8篇
  1974年   7篇
  1973年   8篇
  1972年   11篇
  1971年   6篇
  1970年   4篇
  1969年   5篇
  1968年   5篇
  1967年   7篇
  1966年   4篇
排序方式: 共有526条查询结果,搜索用时 62 毫秒
11.
The system to be controlled produces n products simultaneously in fixed proportions every time it is activated. Demands for the products in any period are components of an n dimensional vector random variable with known distribution function. Cases of excess demands backlogged and excess demands lost are considered. In the former the notion of k convexity can be generalized to guarantee relatively simple form for the optimal policy in an n decision problem. In the latter, this generalization was not successful although when there is no setup cost, a convexity argument can be used to show that the optimal policy has a simple form.  相似文献   
12.
13.
An algorithm is given for solving minimum-cost flow problems where the shipping cost over an arc is a convex function of the number of units shipped along that arc. This provides a unified way of looking at many seemingly unrelated problems in different areas. In particular, it is shown how problems associated with electrical networks, with increasing the capacity of a network under a fixed budget, with Laplace equations, and with the Max-Flow Min-Cut Theorem may all be formulated into minimum-cost flow problems in convex-cost networks.  相似文献   
14.
Book reviews     
Exporting Democracy: Fulfilling America's Destiny. By Joshua Muravchik, American Enterprise Institute (1991) ISSN 0–8447–3734–8. $12.95.

Generals in the Palacio. By Roderick Ai Camp. Oxford University Press, (1992), ISBN 0–19–507300–2, £45.

L'Armement en France. Genèse, Ampleur et Coût d'une Industrie By François Chesnais and Claude Serfati, Editions Nathan, Collection Economie/Sciences Sociales, Paris (1992), ISBN 2–09–190086–9.

The Têt Offensive. Intelligence Failure in War. By James Wirtz, Cornell University Press, New York (1991), ISBN 0–8014–2486–0. $38.50.

Restructuring of arms producton in Western Europe. Edited by Michael Brzoska and Peter Lock. Oxford University Press, Oxford (1992), ISBN 0–1982–9147–7. £25.00.

What is Proper Soldiering? A study of new perspectives for the future uses of the Armed Forces of the 1990s. By Michael Harbottle. The Centre for International Peacebuilding, Chipping Norton (1992), £3.50.

The Strategic Defence Initiative By Edward Reiss, Cambridge University Press, Cambridge (1992), ISBN 0–521–41097–5. £30.00.  相似文献   

15.
16.
17.
18.
19.
Book Reviews     
Men, Ideas and Tanks: British Military Thought and Armoured Forces, 1903–1939. By J. P. Harris, Manchester University Press, (1995) ISBN 0 7190 3762 (hardback) £40.00 or ISBN 0 7190 4814 (paperback) £14.99

Fighting for Ireland. By M. L. R. Smith. London and New York: Routledge, (1995) ISBN 0–415–09161–6.

The Fundamentals of British Maritime Doctrine (BR1806) HMSO London (1995) ISBN 0–11–772470‐X £9.50

Regional Conflicts: The Challenges to US‐Russian Co‐Operation Edited by James E. Goodby SIPRI: Oxford University Press 1995 ISBN 019‐S29–171X, £30.00

SIPRI Yearbook 1995 ‐ Armaments, Disarmament and International Security Oxford: Oxford University Press 1995. ISBN 019–829–1930, £60.00.

Drug Trafficking in the Americas Edited by Bruce M. Bagley & William O. Walker III Transaction Publishers, New Brunswick, (USA), 1994 ISBN 1–56000–752–4.

Raglan: From the Peninsula to the Crimea By John Sweetman, Arms & Armour 1993. ISBN 1–85409–059–3. £19.00.  相似文献   

20.
A pseudo-monotonic interval program is a problem of maximizing f(x) subject to x ε X = {x ε Rn | a < Ax < b, a, b ε Rm} where f is a pseudomonotonic function on X, the set defined by the linear interval constraints. In this paper, an algorithm to solve the above program is proposed. The algorithm is based on solving a finite number of linear interval programs whose solutions techniques are well known. These optimal solutions then yield an optimal solution of the proposed pseudo-monotonic interval program.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号