全文获取类型
收费全文 | 433篇 |
免费 | 18篇 |
国内免费 | 1篇 |
出版年
2021年 | 5篇 |
2019年 | 9篇 |
2018年 | 5篇 |
2017年 | 6篇 |
2016年 | 10篇 |
2015年 | 6篇 |
2014年 | 10篇 |
2013年 | 102篇 |
2012年 | 5篇 |
2011年 | 5篇 |
2010年 | 7篇 |
2009年 | 4篇 |
2008年 | 6篇 |
2007年 | 4篇 |
2006年 | 6篇 |
2002年 | 3篇 |
2001年 | 3篇 |
2000年 | 3篇 |
1998年 | 5篇 |
1997年 | 6篇 |
1996年 | 10篇 |
1995年 | 4篇 |
1994年 | 5篇 |
1993年 | 12篇 |
1992年 | 11篇 |
1991年 | 10篇 |
1990年 | 4篇 |
1989年 | 8篇 |
1988年 | 10篇 |
1987年 | 7篇 |
1986年 | 8篇 |
1985年 | 11篇 |
1984年 | 6篇 |
1983年 | 6篇 |
1982年 | 6篇 |
1981年 | 5篇 |
1980年 | 8篇 |
1979年 | 11篇 |
1978年 | 9篇 |
1976年 | 9篇 |
1975年 | 11篇 |
1974年 | 6篇 |
1973年 | 10篇 |
1972年 | 9篇 |
1971年 | 5篇 |
1970年 | 8篇 |
1969年 | 6篇 |
1968年 | 5篇 |
1967年 | 6篇 |
1966年 | 3篇 |
排序方式: 共有452条查询结果,搜索用时 15 毫秒
381.
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. 相似文献
382.
Richard Ehrhardt 《海军后勤学研究》1985,32(2):347-359
The operating characteristics of (s,S) inventory systems are often difficult to compute, making systems design and sensitivity analysis tedious and expensive undertakings. This article presents a methodology for simplified sensitivity analysis, and derives approximate expressions for operating characteristics of a simple (s,S) inventory system. The operating characteristics under consideration are the expected values of total cost per period, holding cost per period, replenishment cost per period, backlog cost per period, and backlog frequency. The approximations are obtained by using least-squares regression to fit simple functions to the operating characteristics of a large number of inventory items with diverse parameter settings. Accuracy to within a few percent of actual values is typical for most approximations. Potential uses of the approximations are illustrated for several idealized design problems, including consolidating demand from several locations, and tradeoffs for increasing service or reducing replenishment delivery lead time. 相似文献
383.
Control charts are widely used for process surveillance. The design of a control chart refers to the choice of sample size, the width of the control limits, and the interval between samples. Economic designs have been widely investigated and shown to be an effective method of determining control chart parameters. This article describes two different manufacturing process models to which the X¯ control chart is applied: The first model assumes that the process continues in operation while searches for the assignable cause are made, and the second assumes that the process must be shut down during the search. Economic models of the control chart for these two manufacturing process models are developed, and the sensitivity of the control chart parameters to the choice of model is explored. It is shown that the choice of the proper manufacturing process model is critical because selection of an inappropriate process model may result in significant economic penalties. 相似文献
384.
385.
386.
387.
In this article we present some advanced basis or block-pivoting, relaxation, and feasible direction methods for solving linear programming problems. Preliminary computational results appear to indicate that the former two types of simplex-based procedures may hold promise for solving linear programming problems, unlike the third type of scheme which is shown to be computationally unattractive. 相似文献
388.
To solve linear fixed charge problems with Murty's vertex ranking algorithm, one uses a simplex algorithm and a procedure to determine the vertices adjacent to a given vertex. In solving fixed charge transportation problems, the simplex algorithm simplifies to the stepping-stone algorithm. To find adjacent vertices on transportation polytopes, we present a procedure which is a simplification of a more general procedure for arbitrary polytopes. 相似文献
389.
This paper investigates the effect on the optimum solution of a capacitated generalized transportation problem when any coefficient of any row constraint is continuously varied as a linear function of a single parameter. The entire analysis is divided into three parts. Results are derived relative to the cases when the coefficient under consideration is associated, to a cell where the optimal solution in that cell attains its lower bound or its upper bound. The discussion relative to the case when the coefficient under consideration is associated to a cell in the optimal basis is given in two parts. The first part deals with the primal changes of the optimal solution while the second part is concerned with the dual changes. It is shown that the optimal cost varies in a nonlinear fashion when the coefficient changes linearly in certain cases. The discussion in this paper is limited to basis-preserving operators for which the changes in the data are such that the optimum bases are preserved. Relevant algorithms and illustrations are provided throughout the paper. 相似文献
390.
This paper investigates the effect on the optimum solution of a capacitated generalized transportation problem when certain data of the problem are continuously varied as a linear function of a single parameter. First the rim conditions, then the cost coefficients, and finally the cell upper bounds are varied parametrically and the effect on the optimal solution, the associated change in costs and the dual changes are derived. Finally the effect of simultaneous changes in both cost coefficients and rim conditions are investigated. Bound operators that effect changes in upper bounds are shown to be equivalent to rim operators. The discussion in this paper is limited to basis preserving operators for which the changes in the data are such that the optimum bases are preserved. 相似文献