全文获取类型
收费全文 | 572篇 |
免费 | 13篇 |
出版年
2021年 | 6篇 |
2019年 | 13篇 |
2018年 | 9篇 |
2017年 | 11篇 |
2016年 | 9篇 |
2015年 | 9篇 |
2013年 | 105篇 |
2010年 | 5篇 |
2009年 | 9篇 |
2008年 | 10篇 |
2006年 | 5篇 |
2005年 | 8篇 |
2004年 | 12篇 |
2003年 | 8篇 |
2002年 | 5篇 |
2001年 | 5篇 |
2000年 | 7篇 |
1999年 | 5篇 |
1998年 | 7篇 |
1997年 | 6篇 |
1996年 | 17篇 |
1995年 | 7篇 |
1994年 | 9篇 |
1993年 | 7篇 |
1992年 | 11篇 |
1991年 | 18篇 |
1990年 | 7篇 |
1989年 | 12篇 |
1988年 | 12篇 |
1987年 | 14篇 |
1986年 | 16篇 |
1985年 | 18篇 |
1984年 | 9篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1981年 | 6篇 |
1980年 | 12篇 |
1979年 | 6篇 |
1978年 | 9篇 |
1977年 | 9篇 |
1976年 | 9篇 |
1975年 | 7篇 |
1974年 | 8篇 |
1972年 | 11篇 |
1971年 | 12篇 |
1970年 | 11篇 |
1969年 | 8篇 |
1968年 | 9篇 |
1967年 | 9篇 |
1966年 | 9篇 |
排序方式: 共有585条查询结果,搜索用时 171 毫秒
541.
542.
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. 相似文献
543.
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. 相似文献
544.
Dennis E. Smith 《海军后勤学研究》1973,20(1):161-179
Computer simulation has many advantages. However, one major disadvantage is that, in all too many cases, the attempt to use computer simulation to find an optimum solution to a problem rapidly degenerates into a trial-and-error process. Techniques for overcoming this disadvantage, i. e., for making optimization and computer simulation more compatible, are applicable at two points in the development of the overall computer simulation. Techniques which are used within actual construction of the mathematical models comprising the simulation will be labeled as internal methods, while those which are used after the simulation has been completely developed will be termed external methods Because external methods appear to offer the largest potential payoff, discussion is restricted to these methods, which are essentially search techniques. In addition, the development of an “Optimizer” computer program based on these techniques is suggested Although drawbacks to the use of search techniques in the computer simulation framework exist, these techniques do offer potential for “optimization.” The modification of these techniques to satisfy the requirements of an “Optimizer” is discussed. 相似文献
545.
546.
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. 相似文献
547.
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. 相似文献
548.
Sheldon E. Haber 《海军后勤学研究》1976,23(3):535-543
This paper focuses on trends in the occupational structure of the military and civilian sectors of the economy. Some implications of these trends for manpower policies for the all-volunteer military establishment are examined. 相似文献
549.
Jatinder N. D. Gupta 《海军后勤学研究》1976,23(2):235-243
In this paper the problem of finding an optimal schedule for the n-job, M-machine flowshop scheduling problem is considered when there is no intermediate space to hold partially completed jobs and the objective function is to minimize the weighted sum of idle times on all machines. By assuming that jobs are processed as early as possible, the problem is modeled as a traveling salesman problem and solved by known solution techniques for the traveling salesman problem. A sample problem is solved and a special case, one involving only two machines, is discussed. 相似文献
550.
Recent efforts in the field of dynamic programming have explored the feasibility of solving certain classes of integer programming problems by recursive algorithms. Special recursive algorithms have been shown to be particularly effective for problems possessing a 0–1 attribute matrix displaying the “nesting property” studied by, Ignall and Veinott in inventory theory and by Glover in network flows. This paper extends the class of problem structures that has been shown amenable to recursive exploitation by providing an efficient dynamic programming approach for a general transportation scheduling problem. In particular, we provide alternative formulations lor the scheduling problem and show how the most general of these formulations can be readily solved vis a vis recursive techniques. 相似文献