全文获取类型
收费全文 | 911篇 |
免费 | 28篇 |
出版年
2020年 | 8篇 |
2019年 | 18篇 |
2017年 | 24篇 |
2016年 | 17篇 |
2015年 | 22篇 |
2014年 | 21篇 |
2013年 | 171篇 |
2011年 | 8篇 |
2010年 | 10篇 |
2009年 | 15篇 |
2007年 | 11篇 |
2006年 | 10篇 |
2005年 | 13篇 |
2004年 | 17篇 |
2003年 | 9篇 |
2002年 | 15篇 |
2001年 | 9篇 |
2000年 | 11篇 |
1999年 | 13篇 |
1998年 | 20篇 |
1997年 | 15篇 |
1996年 | 14篇 |
1995年 | 15篇 |
1994年 | 27篇 |
1993年 | 22篇 |
1992年 | 18篇 |
1991年 | 24篇 |
1990年 | 13篇 |
1989年 | 18篇 |
1988年 | 20篇 |
1987年 | 22篇 |
1986年 | 18篇 |
1985年 | 18篇 |
1984年 | 14篇 |
1983年 | 12篇 |
1982年 | 12篇 |
1981年 | 16篇 |
1980年 | 11篇 |
1979年 | 16篇 |
1978年 | 15篇 |
1976年 | 12篇 |
1975年 | 13篇 |
1974年 | 15篇 |
1973年 | 12篇 |
1972年 | 17篇 |
1971年 | 10篇 |
1970年 | 11篇 |
1969年 | 9篇 |
1968年 | 8篇 |
1967年 | 9篇 |
排序方式: 共有939条查询结果,搜索用时 0 毫秒
201.
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. 相似文献
202.
This paper analyzes the problem faced by a field commander who, confronted by an enemy on N battlefields, must determine an interdiction policy for the enemy's logistics system which minimizes the amount of war material flowing through this system per unit time. The resource utilized to achieve this interdiction is subject to constraint. It can be shown that this problem is equivalent to determining the set of arcs Z* to remove subject to constraint from a directed graph G such that the resulting maximal flow is minimized. A branch and bound algorithm for the solution to this problem is described, and a numerical example is provided. 相似文献
203.
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. 相似文献
204.
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. 相似文献
205.
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. 相似文献
206.
The intent of this paper is to demonstrate that the theory of stationary point processes is a useful tool for the analysis of stationary inventory systems. In conventional inventory theory, the equilibrium distributions for a specified inventory policy are obtained, whenever possible, by recursive or limiting procedures, or both. A different and more direct approach, based on stationary point processes, is proposed here. The time instants at which stock delivery is effected are viewed as points of the stationary point process, which possesses uniform statistical properties on the entire real axis; hence the equilibrium statistics of the inventory process can be calculated directly. In order to best illustrate this approach, various examples are given, including some that constitute new results. 相似文献
207.
Although cycling in the simplex method has long been known, a number of theoretical questions concerning cycling have not been fully answered. One of these, stated in [3], is to find the smallest example of cycling, and Beale's example with three equations and seven variables is conjectured to be the smallest one. The exact bounds on dimensions of cycling examples are established in this paper. We show that Beale's example is the smallest one which cycles at a non-optimal solution, that a smaller one can cycle at the optimum, and that, in general (including the completely degenerate case), a cycling example must have at least two equations, at least six variables, and at least three non-basic variables. Examples and geometries are given for the extreme cases, showing that the bounds are sharp. 相似文献
208.
This paper presents a linear programming model of a fleet of vessels which is required to transport quantities of cargo, such as coal, iron ore, limestone, and salt from certain producing ports to specific destination ports. This model has been implemented and is currently being used both for planning purposes and as an aid in scheduling the trips to be made by each vessel. 相似文献
209.
210.
Thomas J. Lorenzen 《海军后勤学研究》1985,32(1):57-69
This article considers a general method for acceptance/rejection decisions in lot-by-lot sampling situations. Given arbitrary cost functions for sampling, accepting, and rejecting (where the cost can depend on the quality of the item) and a prior distribution on supplier quality, formulas are derived that lead to the minimal cost single-staged inspection plan. For the Bernoulli case, where each item is classified as acceptable or defective, the formulas simplify immensely. A computer code for solving the Bernoulli case is given. 相似文献