全文获取类型
收费全文 | 826篇 |
免费 | 22篇 |
出版年
2019年 | 17篇 |
2018年 | 8篇 |
2017年 | 23篇 |
2016年 | 16篇 |
2015年 | 20篇 |
2014年 | 16篇 |
2013年 | 166篇 |
2011年 | 9篇 |
2010年 | 8篇 |
2009年 | 16篇 |
2008年 | 8篇 |
2007年 | 8篇 |
2006年 | 11篇 |
2005年 | 15篇 |
2004年 | 17篇 |
2003年 | 9篇 |
2002年 | 12篇 |
2000年 | 10篇 |
1999年 | 10篇 |
1998年 | 14篇 |
1997年 | 8篇 |
1996年 | 14篇 |
1994年 | 21篇 |
1993年 | 17篇 |
1992年 | 12篇 |
1991年 | 25篇 |
1990年 | 9篇 |
1989年 | 19篇 |
1988年 | 17篇 |
1987年 | 21篇 |
1986年 | 23篇 |
1985年 | 24篇 |
1984年 | 11篇 |
1983年 | 9篇 |
1982年 | 8篇 |
1981年 | 9篇 |
1980年 | 7篇 |
1979年 | 11篇 |
1978年 | 14篇 |
1977年 | 7篇 |
1976年 | 11篇 |
1975年 | 7篇 |
1974年 | 12篇 |
1973年 | 9篇 |
1972年 | 16篇 |
1971年 | 9篇 |
1970年 | 16篇 |
1969年 | 10篇 |
1968年 | 7篇 |
1967年 | 11篇 |
排序方式: 共有848条查询结果,搜索用时 15 毫秒
161.
A stochastically constrained optimal replacement model for capital equipment is constructed. Each piece of capital equipment, or machine, is characterized by its age and “utility” or “readiness” class. The readiness of a machine at any age is a stochastic function of its initial utility class and its age. The total discounted replacement cost of several replacement streams, each commencing with an initial machine, is minimized with respect to the replacement age and initial utility class of each machine, subject to a readiness constraint stating the lower bound on the expected number of machines in each utility class at any time. A general solution procedure is outlined and a specific case is solved in detail. 相似文献
162.
Alan J. Kaplan 《海军后勤学研究》1976,23(4):687-695
We address a single product, continuous review model with stationary Poisson demand. Such a model has been effectively studied when mean demand is known. However, we are concerned with managing new items for which only a Bayesian prior distribution on the mean is available. As demand occurs, the prior is updated and our control parameters are revised. These include the reorder point (R) and reorder quantity (Q). Deemer, taking a clue from some earlier RAND work, suggested using a model appropriate for known mean, but using a Compound Poisson distribution for demand rather than Poisson to reflect uncertainty about the mean. Brown and Rogers also used this approach but within a periodic review context. In this paper we show how to compute optimum reorder points for a special problem closely related to the problem of real interest. In terms of the real problem, subject to a qualification to be discussed, the reorder points found are upper bounds for the optimum. At the same time, the reorder points found can never exceed those found by the Compound Poisson (Deemer) approach. And they can be smaller than those found when there is no uncertainty about the mean. As a check, the Compound Poisson and proposed approach are compared by simulation. 相似文献
163.
The problem of finding minimal disconnecting sets for multi-commodity directed networks may be solved using an arc-path formulation and Gomory's all-integer integer programming algorithm. However, the number of network constraints may be astronomical for even moderately sized networks. This paper develops a finite algorithm similar to Gomory's, but requiring no more than m rows in the tableau, where m is the number of arcs in the network. 相似文献
164.
A mixed optimization technique for optimal machine replacement is presented which allows much more flexibility than previous models. Optimal purchase, maintenance and sale of a given machine between any two given points in time is treated as a subproblem, which one may choose to solve via control theory, dynamic programming, or practical engineering considerations. (A control theory formulation is used in the paper as an illustration.) These subproblem solutions are then incorporated into a Wagner-Whitin formulation for solution of the full problem. The technique is particularly useful for problems with such asymmetries as an existing initial machine or uneven technological change. A simple numerical example is solved in the Appendix. 相似文献
165.
The problem of determining multicommodity flows over a capacitated network subject to resource constraints may be solved by linear programming; however, the number of potential vectors in most applications is such that the standard arc-chain formulation becomes impractical. This paper describes an approach—an extension of the column generation technique used in the multicommodity network flow problem—that simultaneously considers network chain selection and resource allocation, thus making the problem both manageable and optimal. The flow attained is constrained by resource availability and network capacity. A minimum-cost formulation is described and an extension to permit the substitution of resources is developed. Computational experience with the model is discussed. 相似文献
166.
J. P. Evans 《海军后勤学研究》1970,17(3):281-286
In this paper we examine the relationship between two constraint qualifications developed by Abadie and Arrow, Hurwicz, and Uzawa. A third constraint qualification is discussed and shown to be weaker than either of those mentioned above. 相似文献
167.
168.
169.
170.