全文获取类型
收费全文 | 893篇 |
免费 | 21篇 |
出版年
2021年 | 14篇 |
2019年 | 29篇 |
2018年 | 19篇 |
2017年 | 20篇 |
2016年 | 20篇 |
2015年 | 20篇 |
2014年 | 11篇 |
2013年 | 166篇 |
2011年 | 8篇 |
2009年 | 9篇 |
2008年 | 8篇 |
2007年 | 11篇 |
2006年 | 11篇 |
2005年 | 15篇 |
2004年 | 16篇 |
2003年 | 10篇 |
2002年 | 8篇 |
2000年 | 14篇 |
1999年 | 10篇 |
1998年 | 12篇 |
1997年 | 24篇 |
1996年 | 19篇 |
1994年 | 18篇 |
1993年 | 7篇 |
1992年 | 11篇 |
1991年 | 22篇 |
1990年 | 12篇 |
1989年 | 19篇 |
1988年 | 12篇 |
1987年 | 21篇 |
1986年 | 16篇 |
1985年 | 16篇 |
1984年 | 12篇 |
1983年 | 15篇 |
1982年 | 13篇 |
1981年 | 13篇 |
1980年 | 16篇 |
1979年 | 17篇 |
1978年 | 14篇 |
1977年 | 15篇 |
1976年 | 14篇 |
1975年 | 12篇 |
1974年 | 18篇 |
1973年 | 18篇 |
1972年 | 15篇 |
1971年 | 19篇 |
1970年 | 9篇 |
1969年 | 11篇 |
1968年 | 10篇 |
1967年 | 8篇 |
排序方式: 共有914条查询结果,搜索用时 31 毫秒
211.
In this paper a model is developed for determining optimal strategies for two competing firms which are about to submit sealed tender bids on K contracts. A contract calls for the winning firm to supply a specific amount of a commodity at the bid price. By the same token, the production of that commodity involves various amounts of N different resources which each firm possesses in limited quantities. It is assumed that the same two firms bid on each contract and that each wants to determine a bidding strategy which will maximize its profits subject to the constraint that the firm must be able to produce the amount of products required to meet the contracts it wins. This bidding model is formulated as a sequence of bimatrix games coupled together by N resource constraints. Since the firms' strategy spaces are intertwined, the usual quadratic programming methods cannot be used to determine equilibrium strategies. In lieu of this a number of theorems are given which partially characterize such strategies. For the single resource problem techniques are developed for determining equilibrium strategies. In the multiple resource problem similar methods yield subequilibrium strategies or strategies that are equilibrium from at least one firm's point of view. 相似文献
212.
Two types of warranties are analyzed. These are the free-replacement warranty, under which failed items are replaced free of charge until a specified total operating time has been achieved, and the pro rata warranty, under which items that fail prior to a specified time are replaced at pro rata cost to the buyer. Both the buyer's and seller's points of view are considered. The basis of the analysis is a comparison of warranted and unwarranted (otherwise identical) items with regard to long-run cost to the buyer and long-run profit to the seller. Application of the results requires knowledge of certain characteristics of the life distribution of the items in question. Parametric and nonparametric methods of estimation of these characteristics from incomplete data are discussed. Single and multiple failure-mode situations are considered. Some solutions to the problem are illustrated using incomplete data on failure times of an aircraft component. 相似文献
213.
This paper presents the details for applying and specializing the work of Ellis Johnson [10] and [11] to develop a primal code for the well-known capacitated transportation problem. The code was developed directly from the work of Johnson, but is similar to codes developed by Glover, Karney, Klingman, and Napier [6] and Srinivasan and Thompson [14]. The emphasis in the presentation is the use of the graphical representation of the basis to carry out the revised simplex operations. This is a means of exploiting the special structure and sparseness of the constraint matrix to minimize computational effort and storage requirements. We also present the results of solving several large problems with the code developed. 相似文献
214.
The first problem considered in this paper is concerned with the assembly of independent components into parallel systems so as to maximize the expected number of systems that perform satisfactorily. Associated with each component is a probability of it performing successfully. It is shown that an optimal assembly is obtained if the reliability of each assembled system can be made equal. If such equality is not attainable, then bounds are given so that the maximum expected number of systems that perform satisfactorily will lie within these stated bounds; the bounds being a function of an arbitrarily chosen assembly. An improvement algorithm is also presented. A second problem treated is concerned with the optimal design of a system. Instead of assembling given units, there is an opportunity to “control” their quality, i.e., the manufacturer is able to fix the probability, p, of a unit performing successfully. However, his resources, are limited so that a constraint is imposed on these probabilities. For (1) series systems, (2) parallel systems, and (3) k out of n systems, results are obtained for finding the optimal p's which maximize the reliability of a single system, and which maximize the expected number of systems that perform satisfactorily out of a total assembly of J systems. 相似文献
215.
216.
This paper treats the problem of sequencing n jobs on two machines in a “flow shop.” (That is, each job in the shop is required to flow through the same sequence of the machines.) The processing time of a given job on a given machine is assumed to be distributed exponentially, with a known mean. The objective is to minimize the expected job completion time. This paper proves an optimal ordering rule, previously conjectured by Talwar [10]. A formula is also derived through Markov Chain analysis, which evaluates the expected job completion time for any given sequence of the jobs. In addition, the performance of a heuristic rule is discussed in the light of the optimal solution. 相似文献
217.
Basil A. Kalymon 《海军后勤学研究》1973,20(1):1-11
Structured finite action-finite state space discounted Markovian decision problems are analyzed. Any problem of a general class is shown to be equivalent to a “separated” problem with decomposable problem structure. A modified policy iteration approach is developed for this decomposable reformulation. Both analytic and computer evaluations of the decomposition algorithm's effectiveness are presented. 相似文献
218.
Harvey M. Wagner 《海军后勤学研究》1973,20(2):265-268
This paper pruvides a smaller equivalelnt bounded variable transportation problem than that in Charnes, Glover, and Klingman [1] for the lower bounded and partial upper bounded distribution model. 相似文献
219.
This paper deals with the numerical problems arising in the computation of higher order moments of the busy period for certain classical queues of the M|G|I type, both in discrete and in continuous time The classical functional equation for the moment generating function of the busy period is used. The higher order derivatives at zero of the moment generating function are computed by repeated use of the classical differentiation formula of Fá di Bruno. Moments of order up to fifty may be computed in this manner A variety of computational aspects of Fá di Bruno's formula, which may be of use in other areas of application, are also discussed in detail. 相似文献
220.
Richard M. Soland 《海军后勤学研究》1973,20(2):325-340
We present a branch and bound algorithm to solve mathematical programming problems of the form: Find x =|(x1,…xn) to minimize Σ?i0(x1) subject to x?G, l≦x≦L and Σ?i0(x1)≦0, j=1,…,m. With l=(l1,…,ln) and L=(L1,…,Ln), each ?ij is assumed to be lower aemicontinuous and piecewise convex on the finite interval [li.Li]. G is assumed to be a closed convex set. The algorithm solves a finite sequence of convex programming problems; these correspond to successive partitions of the set C={x|l ≦ x ≦L} on the bahis of the piecewise convexity of the problem functions ?ij. Computational considerations are discussed, and an illustrative example is presented. 相似文献