全文获取类型
收费全文 | 461篇 |
免费 | 11篇 |
国内免费 | 1篇 |
专业分类
473篇 |
出版年
2019年 | 10篇 |
2018年 | 14篇 |
2017年 | 9篇 |
2016年 | 12篇 |
2015年 | 3篇 |
2014年 | 10篇 |
2013年 | 122篇 |
2012年 | 5篇 |
2010年 | 9篇 |
2007年 | 6篇 |
2005年 | 10篇 |
2004年 | 5篇 |
2003年 | 7篇 |
2002年 | 12篇 |
2000年 | 4篇 |
1999年 | 7篇 |
1998年 | 8篇 |
1997年 | 11篇 |
1996年 | 5篇 |
1995年 | 4篇 |
1994年 | 10篇 |
1993年 | 14篇 |
1992年 | 9篇 |
1991年 | 10篇 |
1990年 | 9篇 |
1989年 | 7篇 |
1988年 | 8篇 |
1987年 | 10篇 |
1986年 | 7篇 |
1985年 | 7篇 |
1984年 | 3篇 |
1983年 | 3篇 |
1982年 | 7篇 |
1981年 | 6篇 |
1980年 | 4篇 |
1979年 | 6篇 |
1978年 | 9篇 |
1977年 | 4篇 |
1976年 | 6篇 |
1975年 | 5篇 |
1974年 | 6篇 |
1973年 | 4篇 |
1972年 | 6篇 |
1971年 | 4篇 |
1970年 | 2篇 |
1969年 | 5篇 |
1968年 | 7篇 |
1967年 | 3篇 |
1966年 | 4篇 |
1948年 | 2篇 |
排序方式: 共有473条查询结果,搜索用时 0 毫秒
1.
John P. Matthews 《海军后勤学研究》1977,24(4):679-690
The purpose of this paper and the accompanying tables is to facilitate the calculation of constrained optimum order quantities and reorder points for an inventory control system where the criterion of optimality is the minimization of expected inventory holding, ordering, and time-weighted backorder costs. The tables provided in the paper allow the identification of the optimal solution when order quantities and/or reorder points are restricted to a set of values which do not include the unconstrained optimal solution. 相似文献
2.
An allocation problem is considered in lvhich different kinds of resources must be allocated to various activities, within a given time period. The opportunities for allo'cation appear randomly during this period. Certain assumptions about the values of possible allocations and the distribution of occurrences of opportunities lead to a dynamic programming formulation of the problem. This leads to a system of ordinary differential equations which are (in theory) solvable recursively, and can be solved numerically to any desired degree of precision. An example is given for the allocation of aircraft-carried weapons to targets of opportunity. 相似文献
3.
A Student's t-test proposed by Ogawa is considered for the hypothesis Ho: σ=σo against the alternative hypothesis H1: σ ≠ σo, where σ is the scale parameter of the Extremevalue distribution of smallest values with known location parameter μ. The test is based on a few sample quantiles chosen from a large sample so as to give asymptotically maximum power to the test when the number of sample quantiles is fixed. A table which facilitates the computation of the test statistic is given. Several schemes for determining the ranks of the sample quantiles by the optimal spacings are compared and the effect of the bias of the estimate of σ on the test is investigated through a Monte Carlo study. 相似文献
4.
5.
6.
Capacity expansion models typically minimize the discounted cost of acquisition and operation over a given planning horizon. In this article we generalize this idea to one in which a capital supply curve replaces the usual discount rate. A capital supply curve is a means to model financial outlook, investment limits, and risk. We show that when such a curve is included in a capacity expansion model, it will, under certain conditions, provide a less capital intensive solution than one which incorporates a discount rate. In this article, we also provide an algorithm that solves capacity expansion models that incorporate a capital supply curve. The attractive feature of this algorithm is that it provides a means to utilize the “discount rate” models efficiently. Throughout, we give applications in power generation planning and computational experience for this application is also presented. 相似文献
7.
This article is concerned with choosing a mix of weapons, subject to constraints, when the targets to be attacked are known imprecisely. It is shown that the correct method for optimizing the mix of weapons involves a pair of nested optimization problems (two-stage optimization). Two methods for optimizing the expected utility of a mix are discussed. The first involves a simultaneous attack model, in which it is implicitly assumed that all weapons are used at once. The second involves a sequential attack model, in which targets appear in random order and are attacked one at a time. Particular attention is given to the question of the appropriate mix of general-purpose and special-purpose weapons. 相似文献
8.
Computerized Scheduling of Seagoing Tankers The tanker scheduling problem considered in this paper is that of the Defense Fuel Supply Center (DFSC) and the Military Sealift Command (MSC) in the worldwide distribution of bulk petroleum products. Routes and cargoes which meet delivery schedule dates for a multiplicity of product requirements at minimum cost are to be determined for a fleet of tankers. A general mathematical programming model is presented, and then a mixed integer model is developed which attempts to reflect the true scheduling task of DFSC and MSC as closely as possible. The problem is kept to within a workable size by the systematic construction of a set of tanker routes which does not contain many possible routes that can be judged unacceptable from practical considerations alone. 相似文献
9.
Let X1 < X2 <… < Xn denote an ordered sample of size n from a Weibull population with cdf F(x) = 1 - exp (?xp), x > 0. Formulae for computing Cov (Xi, Xj) are well known, but they are difficult to use in practice. A simple approximation to Cov(Xi, Xj) is presented here, and its accuracy is discussed. 相似文献
10.
About thirty references that feature naval logistics environments are considered. All are unclassified and all appear in the open literature or are available from the Defense Logistics Studies Information Exchange. Three approaches are identified–data analysis, theoretical models, and readiness indexes–and conclusions are presented as to possibilities for answering two questions: (a) Can the unit do the job? (b) How does readiness depend on resources? Four cases are treated in detail to illustrate methodology. 相似文献