全文获取类型
收费全文 | 375篇 |
免费 | 13篇 |
国内免费 | 1篇 |
出版年
2021年 | 3篇 |
2019年 | 15篇 |
2018年 | 14篇 |
2017年 | 9篇 |
2016年 | 8篇 |
2015年 | 4篇 |
2014年 | 10篇 |
2013年 | 87篇 |
2012年 | 3篇 |
2010年 | 6篇 |
2007年 | 8篇 |
2006年 | 5篇 |
2005年 | 11篇 |
2004年 | 7篇 |
2003年 | 4篇 |
2002年 | 8篇 |
2000年 | 2篇 |
1999年 | 4篇 |
1998年 | 8篇 |
1997年 | 8篇 |
1996年 | 4篇 |
1995年 | 5篇 |
1994年 | 9篇 |
1993年 | 11篇 |
1992年 | 7篇 |
1991年 | 8篇 |
1990年 | 7篇 |
1989年 | 7篇 |
1988年 | 8篇 |
1987年 | 4篇 |
1986年 | 5篇 |
1985年 | 8篇 |
1984年 | 4篇 |
1983年 | 2篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 4篇 |
1979年 | 4篇 |
1978年 | 4篇 |
1977年 | 4篇 |
1976年 | 4篇 |
1975年 | 3篇 |
1974年 | 5篇 |
1973年 | 7篇 |
1972年 | 4篇 |
1969年 | 3篇 |
1968年 | 5篇 |
1967年 | 2篇 |
1966年 | 4篇 |
1948年 | 2篇 |
排序方式: 共有389条查询结果,搜索用时 15 毫秒
351.
The idea of combining relatively simple continuous methods with discrete procedures is used for the construction of suboptimal algorithms for quadratic assignment problems. Depending on the nature of the special problem these steps may vary in complexity. The simplest procedures require minimum storage space and result in tolerable computation times. Different choices of parameters and random variations may be used in order to obtain statistical distributions of suboptimal solutions. Computational results for sample problems indicate improvements on results of Steinberg, Gilmore, and Hillier and Connors. 相似文献
352.
353.
The dynamic transportation problem is a transportation problem over time. That is, a problem of selecting at each instant of time t, the optimal flow of commodities from various sources to various sinks in a given network so as to minimize the total cost of transportation subject to some supply and demand constraints. While the earliest formulation of the problem dates back to 1958 as a problem of finding the maximal flow through a dynamic network in a given time, the problem has received wider attention only in the last ten years. During these years, the problem has been tackled by network techniques, linear programming, dynamic programming, combinational methods, nonlinear programming and finally, the optimal control theory. This paper is an up-to-date survey of the various analyses of the problem along with a critical discussion, comparison, and extensions of various formulations and techniques used. The survey concludes with a number of important suggestions for future work. 相似文献
354.
This paper provides an overview of the Computer-Assisted Search Planning (CASP) system developed for the United States Coast Guard. The CASP information processing methodology is based upon Monte Carlo simulation to obtain an initial probability distribution for target location and to update this distribution to account for drift due to currents and winds. A multiple scenario approach is employed to generate the initial probability distribution. Bayesian updating is used to reflect negative information obtained from unsuccessful search. The principal output of the CASP system is a sequence of probability “maps” which display the current target location probability distributions throughout the time period of interest. CASP also provides guidance for allocating search effort based upon optimal search theory. 相似文献
355.
In this paper we describe an approach to the scheduling and/or real-time control of sorting operations in the presence of deadlines. The problem arises in the postal service where mail has to be sorted by zip codes, and in the banking system where checks have to be sorted according to the bank on which they are drawn. In both applications losses are incurred if items miss their clearing deadlines. For example, in check-sorting an extremely important objective of the control system is to reduce the “float” i.e., the total dollar value of the checks which miss their deadlines. The proposed real-time control system utilizes a linear program which chooses between alternative sort-patterns and assigns the various processing steps to the time periods between deadlines. 相似文献
356.
Recent research has led to several surrogate multiplier search procedures for use in a primal branch-and-bound procedure. As single constrained integer programming problems, the surrogate subproblems are also solved via branch-and-bound. This paper develops the inner play between the surrogate subproblem and the primal branch-and-bound trees which can be exploited to produce a number of computational efficiencies. Most important is a restarting procedure which precludes the need to solve numerous surrogate subproblems at each node of a primal branch-and-bound tree. Empirical evidence suggests that this procedure greatly reduces total computation time. 相似文献
357.
In this paper we consider a simple three-order-statistic asymptotically unbiased estimator of the Weibull shape parameter c for the case in which all three parameters are unknown. Optimal quantiles that minimize the asymptotic variance of this estimator, c? are determined and shown to depend only on the true (unknown) shape parameter value c and in a rather insensitive way. Monte Carlo studies further verified that, in practice where the true shape parameter c is unknown, using always c? with the optimal quantities that correspond to c = 2.0 produces estimates, c?, remarkably close to the theoretical optimal. A second stage estimation procedure, namely recalculating c? based on the optimal quantiles corresponding to c?, was not worth the additional effort. Benchmark simulation comparisons were also made with the best percentile estimator of Zanakis [20] and with a new estimator of Wyckoff, Bain and Engelhardt [18], one that appears to be the best of proposed closed-form estimators but uses all sample observations. The proposed estimator, c?, should be of interest to practitioners having limited resources and to researchers as a starting point for more accurate iterative estimation procedures. Its form is independent of all three Weibull parameters and, for not too large sample sizes, it requires the first, last and only one other (early) ordered observation. Practical guidelines are provided for choosing the best anticipated estimator of shape for a three-parameter Weibull distribution under different circumstances. 相似文献
358.
Thomas L. Saaty 《海军后勤学研究》1966,13(4):447-476
359.
360.