全文获取类型
收费全文 | 797篇 |
免费 | 21篇 |
出版年
2019年 | 25篇 |
2018年 | 14篇 |
2017年 | 21篇 |
2016年 | 19篇 |
2015年 | 21篇 |
2014年 | 20篇 |
2013年 | 183篇 |
2011年 | 13篇 |
2010年 | 10篇 |
2009年 | 14篇 |
2008年 | 8篇 |
2007年 | 13篇 |
2006年 | 10篇 |
2005年 | 14篇 |
2004年 | 13篇 |
2003年 | 8篇 |
2002年 | 14篇 |
2001年 | 7篇 |
2000年 | 8篇 |
1999年 | 11篇 |
1998年 | 12篇 |
1997年 | 9篇 |
1996年 | 10篇 |
1995年 | 7篇 |
1994年 | 20篇 |
1993年 | 17篇 |
1992年 | 12篇 |
1991年 | 16篇 |
1990年 | 11篇 |
1989年 | 18篇 |
1988年 | 17篇 |
1987年 | 18篇 |
1986年 | 17篇 |
1985年 | 13篇 |
1984年 | 9篇 |
1983年 | 10篇 |
1982年 | 8篇 |
1981年 | 8篇 |
1979年 | 10篇 |
1978年 | 13篇 |
1976年 | 8篇 |
1975年 | 8篇 |
1974年 | 9篇 |
1973年 | 9篇 |
1972年 | 13篇 |
1971年 | 6篇 |
1970年 | 12篇 |
1969年 | 7篇 |
1968年 | 6篇 |
1967年 | 7篇 |
排序方式: 共有818条查询结果,搜索用时 18 毫秒
151.
152.
153.
This paper describes the background of the Office of Management Budget Circular A-21, “Principles for Determining Costs Applicable to Grants, Contracts, and Other Agreements with Educational Institutions,” that describes the requirement for effort reporting. A sampling procedure is proposed as an alternative to 100% reporting. 相似文献
154.
Philip J. Boland 《海军后勤学研究》1982,29(4):541-546
A policy of periodic replacement with minimal repair at failure is considered for a complex system. Under such a policy the system is replaced at multiples of some period T while minimal repair is performed at any intervening system failures. The cost of a minimal repair to the system is assumed to be a nonde-creasing function of its age. A simple expression is derived for the expected minimal repair cost in an interval in terms of the cost function and the failure rate of the system. Necessary and sufficient conditions for the existence of an optimal replacement interval are exhibited in the case where the system life distribution is strictly increasing failure rate (IFR). 相似文献
155.
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. 相似文献
156.
157.
In this journal in 1967. Szware presented an algorithm for the optimal routing of a common vehicle fleet between m sources and n sinks with p different types of commodities. The main premise of the formulation is that a truck may carry only one commodity at a time and must deliver the entire load to one demand area. This eliminates the problem of routing vehicles between sources or between sinks and limits the problem to the routing of loaded trucks between sources and sinks and empty trucks making the return trip. Szwarc considered only the transportation aspect of the problem (i. e., no intermediate points) and presented a very efficient algorithm for solution of the case he described. If the total supply is greater than the total demand, Szwarc shows that the problem is equivalent to a (mp + n) by (np + m) Hitchcock transportation problem. Digital computer codes for this algorithm require rapid access storage for a matrix of size (mp + n) by (np + m); therefore, computer storage required grows proportionally to p2. This paper offers an extension of his work to a more general form: a transshipment network with capacity constraints on all arcs and facilities. The problem is shown to be solvable directly by Fulkerson's out-of-kilter algorithm. Digital computer codes for this formulation require rapid access storage proportional to p instead of p2. Computational results indicate that, in addition to handling the extensions, the out-of-kilter algorithm is more efficient in the solution of the original problem when there is a mad, rate number of commodities and a computer of limited storage capacity. 相似文献
158.
Generalized Lagrange Multipliers (GLM) are used to develop an algorithm for a type of multiproduct single period production planning problem which involves discontinuities of the fixed charge variety. Several properties of the GLM technique are developed for this class of problems and from these properties an algorithm is obtained. The problem of resolving the gaps which are exposed by the GLM procedure is considered, and an example involving a quadratic cost function is explored in detail. 相似文献
159.
M. J. Magazine 《海军后勤学研究》1971,18(2):177-183
D. P. Heyman, M. Sobel, and M. J. Magazine among others have shown existence of an optimal policy for control of single server queuing systems. For queues under periodic review existence of an analogous rule is established for multi-server systems. Formulation as a dynamic programming problem is given and proofs for existence are presented for finite horizon, infinite horizon and average cost criteria. 相似文献
160.
J. W. Devanney 《海军后勤学研究》1971,18(3):423-427
This paper develops an adaptive algorithm for determining boiler tube pulling strategies by postulating a Beta prior on the probability that an individual tube is defective. This prior is updated according to Bayes' Rule as a result of the sample obtained during the tube pulling process. 相似文献