全文获取类型
收费全文 | 1062篇 |
免费 | 22篇 |
出版年
2021年 | 12篇 |
2019年 | 27篇 |
2018年 | 14篇 |
2017年 | 32篇 |
2016年 | 23篇 |
2015年 | 27篇 |
2014年 | 29篇 |
2013年 | 227篇 |
2010年 | 10篇 |
2009年 | 12篇 |
2008年 | 10篇 |
2007年 | 11篇 |
2006年 | 11篇 |
2005年 | 13篇 |
2004年 | 12篇 |
2002年 | 15篇 |
2001年 | 12篇 |
2000年 | 10篇 |
1999年 | 12篇 |
1998年 | 22篇 |
1997年 | 18篇 |
1996年 | 17篇 |
1995年 | 13篇 |
1994年 | 25篇 |
1993年 | 22篇 |
1992年 | 17篇 |
1991年 | 24篇 |
1990年 | 12篇 |
1989年 | 20篇 |
1988年 | 30篇 |
1987年 | 22篇 |
1986年 | 35篇 |
1985年 | 22篇 |
1984年 | 16篇 |
1983年 | 12篇 |
1982年 | 13篇 |
1981年 | 16篇 |
1980年 | 12篇 |
1979年 | 17篇 |
1978年 | 17篇 |
1977年 | 9篇 |
1976年 | 9篇 |
1975年 | 15篇 |
1974年 | 14篇 |
1973年 | 12篇 |
1972年 | 15篇 |
1971年 | 9篇 |
1970年 | 13篇 |
1969年 | 12篇 |
1967年 | 8篇 |
排序方式: 共有1084条查询结果,搜索用时 78 毫秒
171.
Multi-echelon logistic systems are essential parts of the service support function of high technology firms. The combination of technological developments and competitive pressures has led to the development of services systems with a unique set of characteristics. These characteristics include (1) low demand probabilities: (2) high cost items; (3) complex echelon structures; (4) existence of pooling mechanisms among stocking locations at the same echelon level; (5) high priority for service, which is often expressed in terms of response time service levels for product groups of items: (6) scrapping of failed parts; and (7) recycling of issued stock due to diagnostic use. This article develops a comprehensive model of a stochastic, multi-echelon inventory system that takes account of the above characteristics. Solutions to the constrained optimization problem are found using a branch and bound procedure. The results of applying this procedure to a spare parts inventory system for a computer manufacturer have led to a number of important policy conclusions. 相似文献
172.
173.
This article presents a branch and bound method for solving the problem of minimizing a separable concave function over a convex polyhedral set where the variables are restricted to be integer valued. Computational results are reported. 相似文献
174.
This paper provides a framework in which warranty policies for non-repairable items can be evaluated according to risk preferences of both buyers and sellers. In particular, a warranty price schedule is established such that sellers are indifferent among the policies. Given this schedule, a buyer's response is expressed by selecting the price-warranty combination that minimizes disutility. Within this framework, a warranty can be viewed as an instrumet of risk management that can induce more sales and greater profitability. For given utility functions, analytical results for the development of a price schedule are developed. Numerical results illustrate the substitution effects between warranty terms, prices, and risk parameters. 相似文献
175.
Single- and multi-facility location problems are often solved with iterative computational procedures. Although these procedures have proven to converage, in practice it is desirable to be able to compute a lower bound on the objective function at each iteration. This enables the user to stop the iterative process when the objective function is within a prespecified tolerance of the optimum value. In this article we generalize a new bounding method to include multi-facility problems with lp distances. A proof is given that for Euclidean distance problems the new bounding procedure is superior to two other known methods. Numerical results are given for the three methods. 相似文献
176.
Lakshman S. Thakur 《海军后勤学研究》1986,33(2):325-358
We implement a solution procedure for general convex separable programs where a series of relatively small piecewise linear programs are solved as opposed to a single large one, and where, based on bound calculations developed in [13] and [14], the ranges of linearization are systematically reduced for successive programs. The procedure inherits ε-convergence to the global optimum in a finite number of steps, but perhaps its most distinct feature is the rigorous way in which ranges containing an optimal solution are reduced from iteration to iteration. This paper describes the procedure, called successive approximation, discusses its convergence, tightness of the bounds, bound-calculation overhead, and its robustness. It presents a computer implementation to demonstrate its effectiveness for general problems and compares it (1) with the more standard separable programming approach and (2) with one of the recent augmented Lagrangian methods [10] included in a comprehensive study of nonlinear programming codes [12]. It seems clear from over 130 cases resulting from 80 distinct problems studied here that significant savings in terms of computational effort can be realized by a judicious use of the procedure, and the ease with which it can be used is appreciably increased by the robustness it shows. Moreover, for most of these problems, the advantage increases as the size, nonlinearity, and the degree of desired accuracy increase. Other important benefits include significantly smaller storage requirements, the ability to estimate the error in the current solution, and to terminate the algorithm as soon as the acceptable level of accuracy has been achieved. Problems requiring up to about 10,000 nonzero elements in their specification and about 45,000 nonzero elements in the generated separable programs resulting from up to 70 original nonlinear variables and 70 nonlinear constraints are included in the computations. 相似文献
177.
J. E. Angus 《海军后勤学研究》1986,33(3):385-390
An alternating renewal process starts at time zero and visits states 1,2,…,r, 1,2, …,r 1,2, …,r, … in sucession. The time spent in state i during any cycle has cumulative distribution function Fi, and the sojourn times in each state are mutually independent, positive and nondegenerate random variables. In the fixed time interval [0,T], let Ui(T) denote the total amount of time spent in state i. In this note, a central limit theorem is proved for the random vector (Ui(T), 1 ≤ i ≤ r) (properly normed and centered) as T → ∞. 相似文献
178.
In many decision-making situations, each activity that can be undertaken may have associated with it both a fixed and a variable cost. Recently, we have encountered serveral practical problems in which the fixed cost of undertaking an activity depends upon which other activities are also undertaken. To our knowledge, no existing optimization model can accomodate such a fixed cost structure. To do so, we have therefore developed a new model called the interactive fixed charge linear programming problem (IFCLP). In this paper we present and motivate problem (IFCLP), study some of its characteristics, and present a finite branch and bound algorithm for solving it. We also discuss the main properties of this algorithm. 相似文献
179.
180.