全文获取类型
收费全文 | 720篇 |
免费 | 22篇 |
国内免费 | 1篇 |
出版年
2021年 | 11篇 |
2019年 | 15篇 |
2018年 | 11篇 |
2017年 | 10篇 |
2016年 | 10篇 |
2015年 | 7篇 |
2014年 | 11篇 |
2013年 | 149篇 |
2010年 | 9篇 |
2009年 | 8篇 |
2008年 | 10篇 |
2007年 | 9篇 |
2006年 | 9篇 |
2004年 | 7篇 |
2003年 | 8篇 |
2002年 | 11篇 |
2001年 | 6篇 |
2000年 | 7篇 |
1998年 | 7篇 |
1997年 | 9篇 |
1996年 | 20篇 |
1995年 | 9篇 |
1994年 | 10篇 |
1993年 | 13篇 |
1992年 | 14篇 |
1991年 | 20篇 |
1990年 | 8篇 |
1989年 | 16篇 |
1988年 | 16篇 |
1987年 | 17篇 |
1986年 | 12篇 |
1985年 | 14篇 |
1984年 | 11篇 |
1983年 | 6篇 |
1982年 | 11篇 |
1981年 | 10篇 |
1980年 | 21篇 |
1979年 | 12篇 |
1978年 | 17篇 |
1976年 | 13篇 |
1975年 | 17篇 |
1974年 | 11篇 |
1973年 | 15篇 |
1972年 | 9篇 |
1971年 | 15篇 |
1970年 | 11篇 |
1969年 | 8篇 |
1968年 | 9篇 |
1967年 | 11篇 |
1966年 | 12篇 |
排序方式: 共有743条查询结果,搜索用时 15 毫秒
151.
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. 相似文献
152.
This paper investigates the effect of the optimal solution of a (capacitated) generalized transportation problem when the data of the problem (the rim conditions—i.e., the available time of machine types and demands of product types, the per unit production costs, the per unit production time and the upper bounds) are continuously varied as a linear function of a single parameter. Operators that effect the transformation of optimal solution associated with such data changes, are shown to be a product of basis preserving operators (described in our earlier papers) that operate on a sequence of adjacent basis structures. Algorithms are furnished for the three types of operators—rim, cost, and weight. The paper concludes with a discussion of the production and managerial interpretations of the operators and a comment on the “production paradox”. 相似文献
153.
Jatinder N. D. Gupta 《海军后勤学研究》1975,22(2):255-269
This paper considers the problem of scheduling a given number of jobs on a specified number of machines in a flowshop where the objective function is to minimize the total throughput time in which all jobs complete processing on all machines. Based on the combinatorial analysis of the problem, several simple algorithms are developed for solving special structure flowshop scheduling problems where the process times are not completely random, but bear a well-defined relationship to one another. The proposed algorithms are both simple and computationally efficient and can optimally solve large-sized problems even with manual computational devices. 相似文献
154.
Bol has discussed consequences of the continuity of production correspondences in connection with relations between efficient input and output vectors. Isoquants of continuous production correspondences are used here to extend this work. Simplifications to existing theory are discussed. 相似文献
155.
This paper considers the problem of defending a set of point targets of differing values. The defense is proportional in that it forces the offense to pay a price, in terms of reentry vehicles expended, that is proportional to the value of the target. The objective of the defense is to balance its resources so that no matter what attack is launched, the offense will have to pay a price greater than or equal to some fixed value for every unit of damage inflicted. The analysis determines which targets should be defended and determines the optimal firing doctrine for interceptors at defended targets. A numerical example is included showing the relationship between the total target damage and the size of the interceptor force for different values of p, the interceptor single shot kill probability. Some generalizations are discussed. 相似文献
156.
157.
The design of a system with many locations, each with many items which may fail while in use, is considered. When items fail, they require repair; the particular type of repair being governed by a probability distribution. As repairs may be lengthy, spares are kept on hand to replace failed items. System ineffectiveness is measured by expected weighted shortages over all items and locations, in steady state. This can be reduced by either having more spares or shorter expected repair times. Design consists of a provisioning of the number of spares for each item, by location; and specifying the expected repair times for each type of repair, by item and location. The optimal design minimizes expected shortages within a budget constraint, which covers both (i) procurement of spares and (ii) procurement of equipment and manning levels for the repair facilities. All costs are assumed to be separable so that a Lagrangian approach is fruitful, yielding an implementable algorithm with outputs useful for sensitivity analysis. A numerical example is presented. 相似文献
158.
Using Mills Differential a game value function ?, used in the Kemeny-Morgenstern-Thompson growth model to show the existence of solutions, is discussed. In doing so, several proofs become shorter, in addition known results are seen in a new context. Finally connections between the existence of a so-called economic solution and the differentiability or non-differentiability of function ? are analyzed. 相似文献
159.
Marcel F. Neuts 《海军后勤学研究》1973,20(2):297-304
This is the first of a sequence of papers dealing with the computational aspects of the transient behavior of queues in discrete time It is shown that for a substantial class of queues of practical interest, a wealth of numerical information may be obtained by relatively unsophisticated methods This approach should prove useful in the analysis of unstable queues which operate over a limited time interval, but is by no means limited to such queues Mathematically the service unit is modeled in terms of a multivariate Markov chain, whose particular structure is used in iterative computation. Many important queue features may then be derived from the n-step transition probabilities of this chain. 相似文献
160.
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. 相似文献