全文获取类型
收费全文 | 168篇 |
免费 | 2篇 |
出版年
2020年 | 3篇 |
2019年 | 6篇 |
2018年 | 8篇 |
2017年 | 5篇 |
2016年 | 5篇 |
2015年 | 6篇 |
2014年 | 3篇 |
2013年 | 61篇 |
2012年 | 2篇 |
2010年 | 1篇 |
2009年 | 1篇 |
2008年 | 3篇 |
2007年 | 1篇 |
2006年 | 2篇 |
2005年 | 1篇 |
2001年 | 2篇 |
2000年 | 1篇 |
1999年 | 2篇 |
1998年 | 4篇 |
1997年 | 4篇 |
1996年 | 4篇 |
1995年 | 3篇 |
1994年 | 3篇 |
1993年 | 3篇 |
1992年 | 3篇 |
1991年 | 3篇 |
1990年 | 4篇 |
1989年 | 2篇 |
1988年 | 3篇 |
1987年 | 1篇 |
1986年 | 4篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1982年 | 3篇 |
1980年 | 2篇 |
1975年 | 2篇 |
1973年 | 1篇 |
1972年 | 1篇 |
1971年 | 1篇 |
1968年 | 2篇 |
1966年 | 1篇 |
排序方式: 共有170条查询结果,搜索用时 28 毫秒
141.
This article defines and develops a simulation optimization system based upon response surface classification and the integration of multiple search strategies. Response surfaces are classified according to characteristics that indicate which search technique will be most successful. Typical surface characteristics include statistical measures and topological features, while search techniques encompass response surface methodology, simulated annealing, random search, etc. The classify-then-search process flow and a knowledge-based architecture are developed and then demonstrated with a detailed computer example. The system is useful not only as an approach to optimizing simulations, but also as a means for integrating search techniques and thereby providing the user with the most promising path toward an optimal solution. © 1995 John Wiley & Sons, Inc. 相似文献
142.
Paul Bracken 《Defense & Security Analysis》1986,2(1):11-20
“Even more than in 1914, governments in our own day are likely to be ignorant of the technical detail of war and the tactical measures that can or cannot (or, more important, must or must not) be taken in various specialized situations. In peacetime the study and preparation of these measures will be relegated to military staffs as being narrow and technical. Today, .... it is almost impossible to get people interested in the tactics and strategy of thermonuclear war. It is now believed that only the prewar moves are of interest, and even those are not too important because deterrence is supposed to be so close to 'automatic'.” Herman Kahn (1960). 相似文献
143.
144.
Consider a central depot that supplies several locations experiencing random demands. Periodically, the depot may place an order for exogenous supply. Orders arrive after a fixed leadtime, and are then allocated among the several locations. Each allocation reaches its destination after a further delay. We consider the special case where the penalty-cost/holding-cost ratio is constant over the locations. Several approaches are given to approximate the dynamic program describing the problem. Each approach provides both a near-optimal order policy and an approximation of the optimal cost of the original problem. In addition, simple but effective allocation policies are discussed. 相似文献
145.
A model for a vehicle moving evasively along a fixed path is defined in terms of a two- state semi-Markov process. An important feature of this model is the continuous movement of the vehicle as a function of time. One potential application of this model is the development of a strategy for the deployment of long-range missiles on long underground tracks. 相似文献
146.
Paul D. Berger 《海军后勤学研究》1972,19(1):159-164
This paper poses a prediction problem in which a linear model is assumed. With a “zero-one” loss structure as the loss from incorrect prediction, it is suggested that least squares may not be appropriate for estimating the parameters of the model. An alternate criterion is proposed and integer programming is used in order to find the estimates, given the proposed criterion. 相似文献
147.
We consider the scheduling of n tasks on a single resource. Each task becomes available for processing at time ai, must be completed by time bi, and requires di time units for processing. The aim is to find a schedule that minimizes the elapsed time to complete all jobs. We present solution algorithms for this problem when job splitting is permitted and when job splitting is not permitted. Then we consider several scheduling situations which arise in practice where these models may apply. 相似文献
148.
An approach is presented for obtaining the moments and distribution of the optimal value for a class of prototype stochastic geometric programs with log-normally distributed cost coefficients. It is assumed for each set of values taken on by the cost coefficients that the resulting deterministic primal program is superconsistent and soluble. It is also required that the corresponding dual program has a unique optimal point with all positive components. It is indicated how one can apply the results obtained under the above assumptions to stochastic programs whose corresponding deterministic dual programs need not satisfy the above-mentioned uniqueness and positivity requirements. 相似文献
149.
150.
This article analyzes a capacity/inventory planning problem with a one‐time uncertain demand. There is a long procurement leadtime, but as some partial demand information is revealed, the firm is allowed to cancel some of the original capacity reservation at a certain fee or sell off some inventory at a lower price. The problem can be viewed as a generalization of the classic newsvendor problem and can be found in many applications. One key observation of the analysis is that the dynamic programming formulation of the problem is closely related to a recursion that arises in the study of a far more complex system, a series inventory system with stochastic demand over an infinite horizon. Using this equivalence, we characterize the optimal policy and assess the value of the additional demand information. We also extend the analysis to a richer model of information. Here, demand is driven by an underlying Markov process, representing economic conditions, weather, market competition, and other environmental factors. Interestingly, under this more general model, the connection to the series inventory system is different. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 2012 相似文献