全文获取类型
收费全文 | 264篇 |
免费 | 16篇 |
出版年
2021年 | 6篇 |
2020年 | 2篇 |
2019年 | 6篇 |
2018年 | 7篇 |
2017年 | 5篇 |
2016年 | 5篇 |
2015年 | 4篇 |
2014年 | 7篇 |
2013年 | 32篇 |
2011年 | 3篇 |
2010年 | 3篇 |
2009年 | 8篇 |
2008年 | 5篇 |
2006年 | 4篇 |
2005年 | 4篇 |
2004年 | 7篇 |
2003年 | 5篇 |
2002年 | 7篇 |
2001年 | 6篇 |
2000年 | 4篇 |
1999年 | 3篇 |
1998年 | 3篇 |
1997年 | 9篇 |
1996年 | 3篇 |
1995年 | 2篇 |
1994年 | 4篇 |
1993年 | 10篇 |
1992年 | 3篇 |
1991年 | 5篇 |
1990年 | 2篇 |
1989年 | 5篇 |
1988年 | 11篇 |
1987年 | 4篇 |
1986年 | 7篇 |
1985年 | 9篇 |
1984年 | 9篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 5篇 |
1979年 | 4篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 3篇 |
1974年 | 6篇 |
1972年 | 2篇 |
1971年 | 8篇 |
1970年 | 4篇 |
1969年 | 5篇 |
1967年 | 2篇 |
排序方式: 共有280条查询结果,搜索用时 0 毫秒
121.
122.
The problem considered involves the assignment of n facilities to n specified locations. Each facility has a given nonnegative flow from each of the other facilities. The objective is to minimize the sum of transportation costs. Assume these n locations are given as points on a two-dimensional plane and transportation costs are proportional to weighted rectangular distances. Then the problem is formulated as a binary mixed integer program. The number of integer variables (all binary) involved equals the number of facilities squared. Without increasing the number of integer variables, the formulation is extended to include “site costs” Computational results of the formulation are presented. 相似文献
123.
A model is developed taking into consideration all the costs (namely cost of sampling, cost of not detecting a change in the process, cost of a false indication of change, and the cost of readjusting detected changes) incurred when a production process, using an unscheduled setup policy, utilizes fraction-defective control charts to control current production. The model is based on the concept of the expected time between detection of changes calling for setups. It is shown that the combination of unscheduled setups and control charts can be utilized in an optimal way if those combinations of sample size, sampling interval, and extent of control limits from process average are used that provide the minimum expected total cost per unit of time. The costs of a production process that uses unscheduled setups in conjunction with the appropriate optimal control charts are compared to the costs of a production process that uses scheduled setups at optimum intervals in conjunction with its appropriate control charts. This comparison indicates the criteria for selecting production processes with scheduled setups using optimal setup intervals over unscheduled setups. Suggestions are made to evaluate the optimal process setup strategy and the accompanying optimal decision parameters, for any specific cost data, by use of computer enumeration. A numerical example for assumed cost and process data is provided. 相似文献
124.
William P. Pierskalla 《海军后勤学研究》1969,16(2):217-228
A stochastic single product convex cost inventory problem is considered in which there is a probability, πj, that the product will become obsolete in the future period j. In an interesting paper, Barankin and Denny essentially formulate the model, but do not describe some of its interesting and relevant ramifications. This paper is written not only to bring out some of these ramifications, but also to describe some computational results using this model. The computational results show that if obsolescence is a distinct possibility in the near future, it is quite important that the probabilities of obsolescence be incorporated into the model before computing the optimal policies. 相似文献
125.
Milton Y. Harris 《海军后勤学研究》1970,17(2):199-206
A new primal-dual linear programming algorithm is exhibited. A proof is given that optimal solutions to both primal and dual problems (when such solutions exist) are found in a finite number of steps by this algorithm. A numerical example is included to illustrate the method. 相似文献
126.
Harold P. Benson 《海军后勤学研究》1985,32(1):165-177
We present a new algorithm for solving the problem of minimizing a nonseparable concave function over a polyhedron. The algorithm is of the branch-and-bound type. It finds a globally optimal extreme point solution for this problem in a finite number of steps. One of the major advantages of the algorithm is that the linear programming subproblems solved during the branch-and-bound search each have the same feasible region. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some preliminary computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several bilinear programming problems with the code. 相似文献
127.
128.
129.
130.
John P. Cann 《Small Wars & Insurgencies》2013,24(1):103-128
The lessons from the two French counterinsurgencies, Indochina and Algeria, give rise to a new understanding of the projection of airpower in remote and hostile environments and the purpose, design, and use of aircraft in counterinsurgency. In both Indochina and Algeria, the campaigns were ones of poverty, and it is their imaginative management under severe resource constraints that provides thoughtful and applicable lessons for today. In both cases, airpower held the promise of delivering victory and solving the resource issue. In Indochina, acquisition of the needed aircraft, operating knowledge, and experience came too slowly to realize this promise. In Algeria, the French embraced the lessons from Indochina and were quite successful and innovative in the use of airpower. The lessons can be reduced to four requirements: (1) a network of airfields for liaison, ground-support, and intra-theater airlift to enable effective air support of ground forces; (2) a solid, reliable, and simple ground-support aircraft capable of operating from forward airfields within range of ground engagements; (3) a capable intra-theater heavy-lift transport to supply the extended ground forces; and (4) helicopter capability to enhance tactical troop mobility and support. 相似文献