全文获取类型
收费全文 | 396篇 |
免费 | 8篇 |
出版年
2021年 | 4篇 |
2019年 | 7篇 |
2018年 | 11篇 |
2017年 | 8篇 |
2016年 | 11篇 |
2014年 | 7篇 |
2013年 | 105篇 |
2011年 | 3篇 |
2010年 | 6篇 |
2009年 | 5篇 |
2008年 | 4篇 |
2006年 | 4篇 |
2005年 | 8篇 |
2004年 | 4篇 |
2003年 | 6篇 |
2002年 | 9篇 |
2001年 | 4篇 |
2000年 | 6篇 |
1999年 | 5篇 |
1998年 | 3篇 |
1997年 | 8篇 |
1996年 | 4篇 |
1995年 | 4篇 |
1994年 | 6篇 |
1993年 | 12篇 |
1992年 | 6篇 |
1991年 | 7篇 |
1990年 | 3篇 |
1988年 | 2篇 |
1987年 | 6篇 |
1986年 | 9篇 |
1985年 | 10篇 |
1984年 | 10篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1981年 | 3篇 |
1980年 | 5篇 |
1979年 | 6篇 |
1978年 | 9篇 |
1977年 | 6篇 |
1976年 | 4篇 |
1975年 | 2篇 |
1974年 | 9篇 |
1972年 | 5篇 |
1971年 | 10篇 |
1970年 | 5篇 |
1969年 | 7篇 |
1968年 | 3篇 |
1967年 | 3篇 |
1966年 | 2篇 |
排序方式: 共有404条查询结果,搜索用时 15 毫秒
81.
This paper considers the problem of computing, by iterative methods, optimal policies for Markov decision processes. The policies computed are optimal for all sufficiently small interest rates. 相似文献
82.
83.
In this paper a very versatile game model is developed for use in the long range planning of our strategic force posture. This highly aggregate model yields optimal force mixes for the triad (land- and sea-based missile systems and bombers) under a variety of constraints. The model described here is a survivability model; however, it is shown how the model can still be used as a measure of overall system effectiveness. Constraints imposed on the problem include both SALT and budget limitations. 相似文献
84.
The literature on maintenance models is surveyed. The focus is on work appearing since the 1965 survey, “Maintenance Policies for Stochastically Failing Equipment: A Survey” by John McCall and the 1965 book, The Mathematical Theory of Reliability, by Richard Barlow and Frank Proschan. The survey includes models which involve an optimal decision to procure, inspect, and repair and/or replace a unit subject to deterioration in service. 相似文献
85.
The problem of finding minimal disconnecting sets for multi-commodity directed networks may be solved using an arc-path formulation and Gomory's all-integer integer programming algorithm. However, the number of network constraints may be astronomical for even moderately sized networks. This paper develops a finite algorithm similar to Gomory's, but requiring no more than m rows in the tableau, where m is the number of arcs in the network. 相似文献
86.
John A. Finchum 《海军后勤学研究》1972,19(2):389-397
The application of statistical expectation to risk density functions and fee/incentive-element relationships is shown to be useful in structuring contract incentives. A mathematical procedure for calculating the expected value of fee for a given risk/incentive arrangement is described along with cost examples and related sensitivity analyses. The structuring of equivalent incentives is demonstrated by the use of the contracting procedure used for procuring the C-5A aircraft. 相似文献
87.
A mixed optimization technique for optimal machine replacement is presented which allows much more flexibility than previous models. Optimal purchase, maintenance and sale of a given machine between any two given points in time is treated as a subproblem, which one may choose to solve via control theory, dynamic programming, or practical engineering considerations. (A control theory formulation is used in the paper as an illustration.) These subproblem solutions are then incorporated into a Wagner-Whitin formulation for solution of the full problem. The technique is particularly useful for problems with such asymmetries as an existing initial machine or uneven technological change. A simple numerical example is solved in the Appendix. 相似文献
88.
J. P. Evans 《海军后勤学研究》1970,17(3):281-286
In this paper we examine the relationship between two constraint qualifications developed by Abadie and Arrow, Hurwicz, and Uzawa. A third constraint qualification is discussed and shown to be weaker than either of those mentioned above. 相似文献
89.
John J. Jarvis 《海军后勤学研究》1969,16(4):525-529
The purpose of this article is to formulate the multi-commodity maximal flow problem into a node-arc form and to show that when decomposition is applied to this form the resulting master and subproblems become precisely those described by Ford & Fulkerson [3] using the arc-chain formulation. A generalization to the problem is then considered which can potentially speed its convergence. 相似文献
90.