全文获取类型
收费全文 | 671篇 |
免费 | 18篇 |
国内免费 | 1篇 |
出版年
2021年 | 15篇 |
2019年 | 16篇 |
2018年 | 7篇 |
2017年 | 11篇 |
2016年 | 8篇 |
2015年 | 15篇 |
2014年 | 13篇 |
2013年 | 111篇 |
2009年 | 8篇 |
2008年 | 14篇 |
2006年 | 10篇 |
2005年 | 7篇 |
2004年 | 6篇 |
2003年 | 6篇 |
2002年 | 9篇 |
2001年 | 11篇 |
2000年 | 7篇 |
1998年 | 15篇 |
1997年 | 12篇 |
1996年 | 14篇 |
1995年 | 12篇 |
1994年 | 10篇 |
1993年 | 13篇 |
1992年 | 14篇 |
1991年 | 16篇 |
1990年 | 10篇 |
1989年 | 13篇 |
1988年 | 22篇 |
1987年 | 13篇 |
1986年 | 21篇 |
1985年 | 15篇 |
1984年 | 11篇 |
1983年 | 8篇 |
1982年 | 8篇 |
1981年 | 11篇 |
1980年 | 14篇 |
1979年 | 15篇 |
1978年 | 13篇 |
1977年 | 11篇 |
1976年 | 7篇 |
1975年 | 14篇 |
1974年 | 11篇 |
1973年 | 7篇 |
1972年 | 10篇 |
1971年 | 10篇 |
1970年 | 8篇 |
1969年 | 10篇 |
1968年 | 7篇 |
1967年 | 6篇 |
1966年 | 8篇 |
排序方式: 共有690条查询结果,搜索用时 15 毫秒
641.
Under fairly general conditions, a nonlinear fractional program, where the function to be maximized has the form f(x)/g(x), is shown to be equivalent to a nonlinear program not involving fractions. The latter program is not generally a convex program, but there is often a convex program equivalent to it, to which the known algorithms for convex programming may be applied. An application to duality of a fractional program is discussed. 相似文献
642.
Mokhtar S. Bazaraa 《海军后勤学研究》1975,22(2):399-404
In this study, a simple and efficient cyclic coordinate search procedure is used to optimize penalty functions. Since the contours of the penalty function are very ill-behaved, an accurate line search is very difficult to achieve. Due to accumulated errors in line search, this makes “simple-minded” search directions just as good as more sophisticated directions, and actually better since they require a smaller effort per iteration. Of course this is only true if the search procedure is able to “ride” along steep ridges, and meanwhile move an appreciable distance towards the optimal, if at all possible. Computational results on the cyclic coordinate method seems to support this point of view, and shows robustness, reliability, and efficiency of the method. 相似文献
643.
To solve linear fixed charge problems with Murty's vertex ranking algorithm, one uses a simplex algorithm and a procedure to determine the vertices adjacent to a given vertex. In solving fixed charge transportation problems, the simplex algorithm simplifies to the stepping-stone algorithm. To find adjacent vertices on transportation polytopes, we present a procedure which is a simplification of a more general procedure for arbitrary polytopes. 相似文献
644.
The loading problem involves the optimal allocation of n objects, each having a specified weight and value, to m boxes, each of specified capacity. While special cases of these problems can be solved with relative ease, the general problem having variable item weights and box sizes can become very difficult to solve. This paper presents a heuristic procedure for solving large loading problems of the more general type. The procedure uses a surrogate procedure for reducing the original problem to a simpler knapsack problem, the solution of which is then employed in searching for feasible solutions to the original problem. The procedure is easy to apply, and is capable of identifying optimal solutions if they are found. 相似文献
645.
This paper considers the search for an evader concealed in one of an arbitrary number of regions, each of which is characterized by its detection probability. We shall be concerned here with the double-sided problem in which the evader chooses this probability secretly, although he may not subsequently move; his aim is to maximize the expected time to detection, while the searcher attempts to minimize it. The situation where two regions are involved has been studied previously and reported on recently. This paper represents a continuation of this analysis. It is normally true that as the number of regions increases, optimal strategies for both searcher and evader are progressively more difficult to determine precisely. However it will be shown that, generally, satisfactory approximations to each are almost as easily derived as in the two region problem, and that the accuracy of such approximations is essentially independent of the number of regions. This means that so far as the evader is concerned, characteristics of the two-region problem may be used to assess the accuracy of such approximate strategies for problems of more than two regions. 相似文献
646.
Uday S. Karmarkar 《海军后勤学研究》1979,26(1):1-19
This paper examines a convex programming problem that arises in several contexts. In particular, the formulation was motivated by a generalization of the stochastic multilocation problem of inventory theory. The formulation also subsumes some “active” models of stochastic programming. A qualititative analysis of the problem is presented and it is shown that optimal policies have a certain geometric form. Properties of the optimal policy and of the optimal value function are described. 相似文献
647.
648.
D. E. Matthews 《海军后勤学研究》1977,24(3):457-462
A simple method is presented for deriving the mean and variance of the queueing time distribution in an M/G/1 queue when the priorities assigned to customers have an assignment probability distribution. Several examples illustrate the results. The mean and variance of the queueing time distribution for the longest service time discipline are derived, and its disadvantages are discussed. 相似文献
649.
An investigation via simulation of system performance of two stage queues in series (single server, first-come, first-served) under the assumption of correlated exponential service times indicates that the system's behavior is quite sensitive to departures from the traditional assumption of mutually independent service times, especially at higher utilizations. That service times at the various stages of a tandem queueing system for a given customer should be correlated is intuitively appealing and apparently not at all atypical. Since tandem queues occur frequently, e.g. production lines and the logistics therewith associated, it is incumbent on both the practitioner and the theoretician that they be aware of the marked effects that may be induced by correlated service times. For the case of infinite interstage storage, system performance is improved by positive correlation and impaired by negative correlation. This change in system performance is reversed however for zero interstage storage and depends on the value of the utilization rate for the case where interstage storage equals unity. The effect due to correlation is shown to be statistically significant using spectral analytic techniques. For correlation equal unity and infinite interstage storage, results are provided for two through twenty-five stages in series to suggest how adding stages affects system performance for ρ>0. In this extreme case of correlation, adding stages has an effect on system performance which depends markedly on the utilization rate. Recursive formulae for the waiting time per customer for the cases of zero, one, and infinite interstage storage are derived. 相似文献
650.
Ronald D. Armstrong 《海军后勤学研究》1977,24(4):619-625
This paper considers the problem of locating m new facilities in the plane so as to minimize a weighted rectangular distance between the new facilities and n existing facilities. A special purpose primal simplex algorithm is developed to solve this problem. The algorithm will maintain at all times a basis of dimension m by m; however, because of the triangularity of the basis matrix, it will not be necessary to form a basis inverse explicitly. 相似文献