全文获取类型
收费全文 | 506篇 |
免费 | 17篇 |
出版年
2021年 | 10篇 |
2020年 | 5篇 |
2019年 | 13篇 |
2018年 | 5篇 |
2017年 | 7篇 |
2016年 | 12篇 |
2015年 | 9篇 |
2014年 | 7篇 |
2013年 | 77篇 |
2011年 | 6篇 |
2009年 | 6篇 |
2007年 | 15篇 |
2005年 | 5篇 |
2004年 | 7篇 |
2003年 | 9篇 |
2002年 | 8篇 |
2001年 | 5篇 |
1999年 | 10篇 |
1998年 | 9篇 |
1997年 | 10篇 |
1996年 | 10篇 |
1995年 | 4篇 |
1994年 | 9篇 |
1993年 | 13篇 |
1992年 | 11篇 |
1991年 | 13篇 |
1990年 | 12篇 |
1989年 | 19篇 |
1988年 | 18篇 |
1987年 | 8篇 |
1986年 | 15篇 |
1985年 | 8篇 |
1984年 | 6篇 |
1982年 | 10篇 |
1981年 | 8篇 |
1980年 | 7篇 |
1979年 | 9篇 |
1978年 | 9篇 |
1977年 | 7篇 |
1976年 | 6篇 |
1975年 | 5篇 |
1974年 | 12篇 |
1973年 | 5篇 |
1972年 | 4篇 |
1971年 | 10篇 |
1970年 | 6篇 |
1969年 | 7篇 |
1968年 | 4篇 |
1967年 | 7篇 |
1948年 | 5篇 |
排序方式: 共有523条查询结果,搜索用时 15 毫秒
351.
The segregated storage problem involves the optimal distribution of products among compartments with the restriction that only one product may be stored in each compartment. The storage capacity of each compartment, the storage demand for each product, and the linear cost of storing one unit of a product in a given compartment are specified. The problem is reformulated as a large set-packing problem, and a column generation scheme is devised to solve the associated linear programming problem. In case of fractional solutions, a branch and bound procedure is utilized. Computational results are presented. 相似文献
352.
This paper reviews a wide variety of manpower and personnel models of the goal programming variety. This is done from a strategy-oriented point of view addressing the problems of interest for immediate implementation as well as basic problems of manpower model research development. Particular emphasis in this paper is concerned with how analytical models can be brought to bear on the problems of combining military and civilian manpower into one management system. This includes a discussion of the computer support arrangements necessary to implement the models. First, we discuss an extension of multilevel models to provide an integrated approach to program planning which includes the dynamics of the manpower requirements-inventory relationships of mixed military-civilian manpower systems. Then, focus is given to some of the potential Navy applications particularly in terms of ways the outputs from the global multilevel model might be interfaced with assignment models for operational planning. The paper concludes with a discussion of static and dynamic multiattribute assignment models which operate on the individual man-job matching level. It is at this level of detail that dynamic mixed manpower systems might be constructed for use in equal employment opportunity planning and for local organization design studies. 相似文献
353.
Hemiter's entropy model for brand purchase behavior has been generalized for Renyi's measure of entropy which is a more general concept than Shannon's measure of entropy used by Herniter and which includes Shannon's measure as a limiting case. The generalized model considered here is more flexible than Herniter's model since it can give different marketing statistics for different products and it can give these statistics even when only some of the brands are considered. 相似文献
354.
A two-dimensional state space Markov Model of a Manpower System with special structure is analyzed. Examples are given from the military services. The probabilistic properties are discussed in detail with emphasis on computation. The basic equations of manpower stocks and flows are analyzed. 相似文献
355.
This paper studies the one-period, general network distribution problem with linear costs. The approach is to decompose the problem into a transportation problem that represents a stocking decision, and into decoupled newsboy problems that represent the realization of demand with the usual associated holding and shortage costs. This approach leads to a characterization of optimal policies in terms of the dual of the transportation problem. This method is not directly suitable for the solution for large problems, but the exact solution for small problems can be obtained. For the numerical solutions of large problems, the problem has been formulated as a linear program with column generation. This latter approach is quite robust in the sense that it is easily extended to incorporate capacity constraints and the multiproduct case. 相似文献
356.
T. U. Zahle 《海军后勤学研究》1971,18(2):283-293
To find the hit probability for a series of correlated shots is, with conventional methods, a very tedious job even for the simplest statistical distributions. Experimental data, however, commonly show the shots lying chain-like on smooth curves about the target. For this case this paper introduces a new method of finding the hit probability without the use of correlation coefficients. The method is based on a transformation, where the target is transformed into a point and each bullet into an area the size of the target. 相似文献
357.
The bottleneck transportation problem can be stated as follows: A set of supplies and a set of demands are specified such that the total supply is equal to the total demand. There is a transportation time associated between each supply point and each demand point. It is required to find a feasible distribution (of the supplies) which minimizes the maximum transportaton time associated between a supply point and a demand point such that the distribution between the two points is positive. In addition, one may wish to find from among all optimal solutions to the bottleneck transportation problem, a solution which minimizes the total distribution that requires the maximum time Two algorithms are given for solving the above problems. One of them is a primal approach in the sense that improving fcasible solutions are obtained at each iteration. The other is a “threshold” algorithm which is found to be far superior computationally. 相似文献
358.
Donald R. Wridman 《海军后勤学研究》1967,14(4):559-568
A “circulating system” is a finite collection of objects, each of which is oscillaling between two states. The prototype system is that of ships on patrcl,each subject to a quasi-regular “duty-service” cycle. There are various restrictions on the time spent in either state by an object and on the number of objects in a state at any one time. Schedules are sought in which the total number in one state is as large and as constant as possible. The maximal average number in one state is calculated, and a necessary and sufficient condition is given for a schedule to achieve it. Procedures are developed for constructing a schedule which achieves the maximal average in the most constant manner. 相似文献
359.
An algorithm, based upon dynamic programming, is developed for a class of fixed-cost cargo loading problems. The problems can be formulated as integer programming problems, but cannot be efficiently solved as such because of computational difficulties. The algorithm developed has proved to be very efficient in an actual operations research study involving over 500 different cargo items, more than 40 possible stops and several types of transportation vehicles. A numerical illustration is provided. 相似文献
360.