全文获取类型
收费全文 | 914篇 |
免费 | 14篇 |
出版年
2021年 | 9篇 |
2019年 | 18篇 |
2018年 | 11篇 |
2017年 | 22篇 |
2016年 | 19篇 |
2015年 | 19篇 |
2014年 | 11篇 |
2013年 | 143篇 |
2012年 | 23篇 |
2011年 | 31篇 |
2010年 | 27篇 |
2009年 | 18篇 |
2008年 | 30篇 |
2007年 | 19篇 |
2006年 | 22篇 |
2005年 | 16篇 |
2004年 | 11篇 |
2001年 | 7篇 |
2000年 | 10篇 |
1999年 | 8篇 |
1998年 | 11篇 |
1997年 | 15篇 |
1996年 | 13篇 |
1995年 | 7篇 |
1994年 | 14篇 |
1993年 | 17篇 |
1992年 | 12篇 |
1991年 | 20篇 |
1990年 | 10篇 |
1989年 | 22篇 |
1988年 | 9篇 |
1987年 | 19篇 |
1986年 | 18篇 |
1985年 | 18篇 |
1984年 | 9篇 |
1983年 | 12篇 |
1982年 | 11篇 |
1981年 | 14篇 |
1980年 | 19篇 |
1979年 | 17篇 |
1978年 | 12篇 |
1977年 | 14篇 |
1976年 | 13篇 |
1975年 | 13篇 |
1974年 | 13篇 |
1973年 | 9篇 |
1972年 | 19篇 |
1971年 | 16篇 |
1969年 | 15篇 |
1968年 | 10篇 |
排序方式: 共有928条查询结果,搜索用时 15 毫秒
31.
32.
John A. Muckstadt 《海军后勤学研究》1978,25(3):377-394
The optimization problem as formulated in the METRIC model takes the form of minimizing the expected number of total system backorders in a two-echelon inventory system subject to a budget constraint. The system contains recoverable items – items subject to repair when they fail. To solve this problem, one needs to find the optimal Lagrangian multiplier associated with the given budget constraint. For any large-scale inventory system, this task is computationally not trivial. Fox and Landi proposed one method that was a significant improvement over the original METRIC algorithm. In this report we first develop a method for estimating the value of the optimal Lagrangian multiplier used in the Fox-Landi algorithm, present alternative ways for determining stock levels, and compare these proposed approaches with the Fox-Landi algorithm, using two hypothetical inventory systems – one having 3 bases and 75 items, the other 5 bases and 125 items. The comparison shows that the computational time can be reduced by nearly 50 percent. Another factor that contributes to the higher requirement for computational time in obtaining the solution to two-echelon inventory systems is that it has to allocate stock optimally to the depot as well as to bases for a given total-system stock level. This essentially requires the evaluation of every possible combination of depot and base stock levels – a time-consuming process for many practical inventory problems with a sizable system stock level. This report also suggests a simple approximation method for estimating the optimal depot stock level. When this method was applied to the same two hypotetical inventory systems indicated above, it was found that the estimate of optimal depot stock is quite close to the optimal value in all cases. Furthermore, the increase in expected system backorders using the estimated depot stock levels rather than the optimal levels is generally small. 相似文献
33.
A. Victor Cabot 《海军后勤学研究》1978,25(3):473-481
In this paper we consider the problem of maximizing the sum of certain quasi-concave functions over a convex set. The functions considered belong to the classes of functions which are known as nonlinear fractional and binonlinear functions. Each individual function is quasi-concave but the sum is not. We show that this nonconvex programming problem can be solved using Generalized Benders Decomposition as developed by Geoffrion. 相似文献
34.
Adequate prediction of a response variable using a multiple linear regression model is shown in this article to be related to the presence of multicollinearities among the predictor variables. If strong multicollinearities are present in the data, this information can be used to determine when prediction is likely to be accurate. A region of prediction, R, is proposed as a guide for prediction purposes. This region is related to a prediction interval when the matrix of predictor variables is of full column rank, but it can also be used when the sample is undersized. The Gorman-Toman ten-variable data is used to illustrate the effectiveness of the region R. 相似文献
35.
A model, for assessing the effectiveness of alternative force structures in an uncertain future conflict, is presented and exemplified. The methodology is appropriate to forces (e.g., the attack submarine force) where alternative unit types may be employed, albeit at differing effectiveness, in the same set of missions. Procurement trade-offs, and in particular the desirability of special purpose units in place of some (presumably more expensive) general purpose units, can be addressed by this model. Example calculations indicate an increase in the effectiveness of a force composed of general purpose units, relative to various mixed forces, with increase in the uncertainty regarding future conflicts. 相似文献
36.
The bounded interval generalized assignment model is a “many-for-one” assignment model. Each task must be assigned to exactly one agent; however, each agent can be assigned multiple tasks as long as the agent resource consumed by performing the assigned tasks falls within a specified interval. The bounded interval generalized assignment model is formulated, and an algorithm for its solution is developed. Algorithms for the bounded interval versions of the semiassignment model and sources-to-uses transportation model are also discussed. 相似文献
37.
Inspection procedures may at times pose a hazard to the system being monitored. In this article, a simple hazardous-inspection model is considered. The character of the optimal ongoing inspection policy (for inspections subsequent to the first) is reviewed, and the possible forms of the optimal initiation policy are established. Efficient computational procedures are developed for calculating optimal policies. Some discussion is included of the counterintuitive nature of some of the results. 相似文献
38.
An optimization method is given for solving problems where a portion of the explicit mathematical form is unknown but can be evaluated. The solution scheme is an iterative process utilizing optimization and subsystem evaluation (such as via simulation). Conditions for the convergence of the iterative process are given. Several published application articles are noted as using this basic methodology. The method is superior to most other numerical optimization procedures. However, the class of problems for which the method is applicable is restricted to problems with enough known structure to generate a convergent iterative procedure. Three numerical examples are given and comparisons made with several other methods of optimizing unknown systems. 相似文献
39.
Preference for food in the function of the time since last consumption and total preference in the function of eating frequency are equivalent mathematical representations of attitudes governing food consumption. The observed and postulated properties of these functions imply a formal correspondence between preference maximizing and variety seeking behavior. 相似文献
40.
Edward L. Hannan 《海军后勤学研究》1982,29(1):113-118
This paper investigates the two-person zero-sum multiple payoff game in which the objective is to minimize a player's total underachievement from a fixed set of goals. It is demonstrated that a previous formulation of this problem can be substantially simplified. 相似文献