全文获取类型
收费全文 | 714篇 |
免费 | 14篇 |
出版年
2020年 | 6篇 |
2019年 | 17篇 |
2018年 | 11篇 |
2017年 | 22篇 |
2016年 | 15篇 |
2015年 | 17篇 |
2014年 | 18篇 |
2013年 | 162篇 |
2012年 | 7篇 |
2010年 | 8篇 |
2009年 | 12篇 |
2008年 | 6篇 |
2007年 | 7篇 |
2006年 | 9篇 |
2005年 | 10篇 |
2004年 | 11篇 |
2002年 | 10篇 |
2001年 | 6篇 |
2000年 | 7篇 |
1999年 | 8篇 |
1998年 | 16篇 |
1997年 | 10篇 |
1996年 | 12篇 |
1995年 | 7篇 |
1994年 | 18篇 |
1993年 | 17篇 |
1992年 | 11篇 |
1991年 | 17篇 |
1990年 | 11篇 |
1989年 | 16篇 |
1988年 | 17篇 |
1987年 | 16篇 |
1986年 | 20篇 |
1985年 | 13篇 |
1984年 | 10篇 |
1983年 | 7篇 |
1982年 | 10篇 |
1981年 | 8篇 |
1980年 | 7篇 |
1979年 | 8篇 |
1978年 | 12篇 |
1976年 | 7篇 |
1975年 | 8篇 |
1974年 | 8篇 |
1973年 | 8篇 |
1972年 | 10篇 |
1970年 | 9篇 |
1969年 | 6篇 |
1968年 | 6篇 |
1967年 | 6篇 |
排序方式: 共有728条查询结果,搜索用时 15 毫秒
141.
This paper considers the problem of locating multiple new facilities in order to minimize a total cost function consisting of the sum of weighted Euclidean distances among the new facilities and between the new and existing facilities, the locations of which are known. A new procedure is derived from a set of results pertaining to necessary conditions for a minimum of the objective function. The results from a number of sample problems which have been executed on a programmed version of this algorithm are used to illustrate the effectiveness of the new technique. 相似文献
142.
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. 相似文献
143.
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. 相似文献
144.
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. 相似文献
145.
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. 相似文献
146.
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. 相似文献
147.
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. 相似文献
148.
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. 相似文献
149.
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. 相似文献
150.
The exact expression is derived for the average stationary cost of a (Q,R) inventory system with lost sales, unit Poisson demands, Erlang-distributed lead times, fixed order cost, fixed cost per unit lost sale, linear holding cost per unit time, and a maximum of one order outstanding. Explicit expressions for the state probabilities and a fast method of calculating them are obtained for the case of Q greater than R. Exponential lead times are analyzed as a special case. A simple cyclic coordinate search procedure is used to locate the minimum cost policy. Examples of the effect of lead time variability on costs are given. 相似文献