全文获取类型
收费全文 | 376篇 |
免费 | 6篇 |
出版年
2021年 | 7篇 |
2019年 | 7篇 |
2018年 | 4篇 |
2017年 | 3篇 |
2016年 | 7篇 |
2015年 | 2篇 |
2014年 | 5篇 |
2013年 | 55篇 |
2012年 | 3篇 |
2009年 | 4篇 |
2007年 | 12篇 |
2005年 | 2篇 |
2004年 | 3篇 |
2003年 | 8篇 |
2002年 | 6篇 |
2001年 | 2篇 |
2000年 | 5篇 |
1999年 | 3篇 |
1998年 | 8篇 |
1997年 | 9篇 |
1996年 | 9篇 |
1995年 | 3篇 |
1994年 | 6篇 |
1993年 | 11篇 |
1992年 | 7篇 |
1991年 | 9篇 |
1990年 | 10篇 |
1989年 | 17篇 |
1988年 | 14篇 |
1987年 | 7篇 |
1986年 | 13篇 |
1985年 | 7篇 |
1984年 | 4篇 |
1983年 | 3篇 |
1982年 | 11篇 |
1981年 | 6篇 |
1980年 | 7篇 |
1979年 | 9篇 |
1978年 | 8篇 |
1977年 | 5篇 |
1976年 | 5篇 |
1975年 | 4篇 |
1974年 | 8篇 |
1973年 | 5篇 |
1972年 | 3篇 |
1971年 | 7篇 |
1970年 | 6篇 |
1969年 | 5篇 |
1967年 | 6篇 |
1948年 | 4篇 |
排序方式: 共有382条查询结果,搜索用时 15 毫秒
351.
This paper investigates a new procedure for solving the general-variable pure integer linear programming problem. A simple transformation converts the problem to one of constructing nonnegative integer solutions to a system of linear diophantine equations. Rubin's sequential algorithm, an extension of the classic Euclidean algorithm, is used to find an integer solution to this system of equations. Two new theorems are proved on the properties of integer solutions to linear systems. This permits a modified Fourier-Motzkin elimination method to be used to construct a nonnegative integer solution. An experimental computer code was developed for the algorithm to solve some test problems selected from the literature. The computational results, though limited, are encouraging when compared with the Gomory all-integer algorithm. 相似文献
352.
353.
This paper presents a simple algorithm for finding the number of restricted k-partitions of a natural number n. The unrestricted k-partitions of n are expressed as the sum of these restricted k-partitions, called inadmissible, and the admissible k-partitions. The simplicity of the algorithm is striking, though all the implications are unclear. 相似文献
354.
Consider the problem of computing an offset circle probability under a normal distribution. One approach is to utilize an infinite series representation in which case it is important to have rapid convergence and a good upper bound on the error introduced by consideration of only a finite number of terms of the series. We relate three seemingly different series representations. In particular we show how two series representations for the bivariate case can be obtained by specializing more general results of Harold Ruben. 相似文献
355.
R. T. Robinson 《海军后勤学研究》1981,28(4):653-663
This paper presents a mathematical model that yields the area drained by a naturally-occurring network of streams. The model is based on empirically derived relationships in the field of quantitative geomorphology and an assumption concerning the probabilistic nature of stream system formation. A wide range of model solutions is indicated, and the model is validated by comparing the results to statistics from actual stream systems. 相似文献
356.
It is well known that a minimal makespan permutation sequence exists for the n × 3 flow shop problem and for the n × m flow shop problem with no inprocess waiting when processing times for both types of problems are positive. It is shown in this paper that when the assumption of positive processing times is relaxed to include nonnegative processing times, optimality of permutation schedules cannot be guaranteed. 相似文献
357.
In this paper we address a bin-packing problem which possesses a variety of modifications of the classic theme. Among these are bin-dependent chip weights, bin costs, and bin-dependent penalties for unused capacity. Lagrangian relaxations are employed in the context of a branch-and-bound framework in order to solve the problem after which substantial computational experience is provided. 相似文献
358.
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. 相似文献
359.
Attahiru Sule Alfa 《海军后勤学研究》1982,29(3):475-482
This paper examines the process by which a user of a queueing system selects his arrival time to the system to compensate for unpredictable delays in the system if he wishes to complete service at a particular time. Considering the case in which all the system users have already decided on their arrival times to the system and will not change these times, this paper investigates how a new user of this system develops his strategy for selecting his arrival time. The distribution of this customer's arrival time is then obtained for a special case. 相似文献
360.
The objective of a diagnostic analysis is to provide a measure of performance of an existing system and estimate the benefits of implementing a new one, if necessary. Firms expect diagnostic studies to be done promptly and inexpensively. Consequently, collection and manipulation of large quantities of data are prohibitive. In this paper we explore aggregate optimization models as tools for diagnostic analysis of inventory systems. We concentrate on the dynamic lot size problem with a family of items sharing the same setup, and on the management of perishable items. We provide upper and lower bounds on the total cost to be expected from the implementation of appropriate systems. However, the major thrust of the paper is to illustrate an approach to analyze inventory systems that could be expanded to cover a wide variety of applications. A fundamental by-product of the proposed diagnostic methodology is to identify the characteristics that items should share to be aggregated into a single family. 相似文献