全文获取类型
收费全文 | 561篇 |
免费 | 15篇 |
出版年
2021年 | 9篇 |
2020年 | 6篇 |
2019年 | 18篇 |
2018年 | 12篇 |
2017年 | 12篇 |
2016年 | 6篇 |
2015年 | 6篇 |
2014年 | 8篇 |
2013年 | 86篇 |
2010年 | 7篇 |
2009年 | 9篇 |
2008年 | 10篇 |
2005年 | 5篇 |
2004年 | 8篇 |
2003年 | 6篇 |
2002年 | 10篇 |
2001年 | 7篇 |
2000年 | 7篇 |
1999年 | 6篇 |
1998年 | 8篇 |
1997年 | 6篇 |
1996年 | 12篇 |
1995年 | 8篇 |
1994年 | 6篇 |
1993年 | 14篇 |
1992年 | 10篇 |
1991年 | 13篇 |
1990年 | 6篇 |
1989年 | 16篇 |
1988年 | 18篇 |
1987年 | 14篇 |
1986年 | 17篇 |
1985年 | 13篇 |
1984年 | 13篇 |
1982年 | 7篇 |
1981年 | 7篇 |
1980年 | 15篇 |
1979年 | 9篇 |
1978年 | 11篇 |
1977年 | 10篇 |
1976年 | 8篇 |
1975年 | 6篇 |
1974年 | 11篇 |
1972年 | 6篇 |
1971年 | 13篇 |
1970年 | 8篇 |
1969年 | 10篇 |
1968年 | 6篇 |
1967年 | 6篇 |
1966年 | 7篇 |
排序方式: 共有576条查询结果,搜索用时 31 毫秒
481.
482.
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. 相似文献
483.
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. 相似文献
484.
This paper models a k-unit service system (e.g., a repair, maintenance, or rental facility) with Poisson arrivals, exponential service times, and no queue. If we denote the number of units that are busy as the state of the system, the state-dependent pricing model formalizes the intuitive notion that when most units are idle, the price (i.e., the service charge per unit time) should be low, and when most units are busy, the price should be higher than the average. A computationally efficient algorithm based on a nonlinear programming formulation of the problem is provided for determination of the optimal state-dependent prices. The procedure ultimately reduces to the search on a single variable in an interval to determine the unique intersection point of a concave increasing function and a linear decreasing function. The algorithm takes, on the average, only about 1/2 second per problem on the IBM 360/65 (FORTRAN G Compiler). A discrete optimal-control approach to the problem is shown to result in essentially the same procedure as the nonlinear-programming formulation. Several properties of the optimal state-dependent prices are given. Comparisons of the optimal values of the objective function for the state-dependent and state-independent pricing policies show that the former is on the average, only about 0.7% better than the latter, which may explain partly why state-dependent pricing is not prevalent in many service systems. Potential generalizations of the model are discussed. 相似文献
485.
486.
Daniel P. Heyman 《海军后勤学研究》1977,24(3):385-405
We consider a single-item inventory system in which the stock level can increase due to items being returned as well as decrease when demands occur. Returned items can be repaired and then used to satisfy future demand, or they can be disposed of. We identify those inventory levels where disposal is the best policy. It is shown that this problem is equivalent to a problem of controlling a single-server queue. When the return and demand processes are both Poisson, we find the optimal policy exactly. When the demand and return processes are more general, we use diffusion approximations to obtain an approximate model, which is then solved. The approximate model requires only mean and variance data. Besides the optimal policy, the output of the models includes such characteristics as the operating costs, the purchase rate for new items, the disposal rate for returned items and the average inventory level. Several numerical examples are given. An interesting by-product of our investigation is an approximation for the steady-state behavior of the bulk GI/G/1 queue with a queue limit. 相似文献
487.
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. 相似文献
488.
The problem posed in this paper is to sequence or route n jobs, each originating at a particular location or machine, undergoing r?1 operations or repairs, and terminating at the location or machine from which it originated. The problem is formulated as a 0-1 integer program, with block diagonal structure, comprised of r assignment subproblems; and a joint set of constraints to insure cyclical squences. To obtain integer results the solutions to each subproblem are ranked as required and combinations thereof are implicitly enumerated. The procedure may be terminated at any step to obtain an approximate solution. Some limited computational results are presented. 相似文献
489.
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. 相似文献
490.
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. 相似文献