全文获取类型
收费全文 | 575篇 |
免费 | 8篇 |
出版年
2021年 | 6篇 |
2020年 | 4篇 |
2019年 | 9篇 |
2018年 | 9篇 |
2017年 | 14篇 |
2016年 | 14篇 |
2015年 | 10篇 |
2014年 | 12篇 |
2013年 | 102篇 |
2012年 | 22篇 |
2011年 | 27篇 |
2010年 | 21篇 |
2009年 | 15篇 |
2008年 | 29篇 |
2007年 | 15篇 |
2006年 | 17篇 |
2005年 | 8篇 |
2004年 | 6篇 |
2003年 | 5篇 |
2002年 | 4篇 |
1998年 | 7篇 |
1997年 | 7篇 |
1995年 | 8篇 |
1994年 | 6篇 |
1993年 | 12篇 |
1992年 | 8篇 |
1991年 | 7篇 |
1989年 | 14篇 |
1988年 | 5篇 |
1987年 | 12篇 |
1986年 | 11篇 |
1985年 | 9篇 |
1984年 | 4篇 |
1983年 | 5篇 |
1982年 | 6篇 |
1981年 | 8篇 |
1980年 | 10篇 |
1979年 | 11篇 |
1978年 | 4篇 |
1977年 | 7篇 |
1976年 | 8篇 |
1975年 | 7篇 |
1974年 | 3篇 |
1973年 | 5篇 |
1972年 | 12篇 |
1971年 | 3篇 |
1970年 | 4篇 |
1969年 | 9篇 |
1968年 | 7篇 |
1966年 | 3篇 |
排序方式: 共有583条查询结果,搜索用时 15 毫秒
501.
In this article, the authors survey and consolidate their investigations during the years 1980-1983 dealing with consequences of errors in inspection sampling models. Some indication of the current and future research is given. 相似文献
502.
503.
504.
This article presents new results which should be useful in finding production decisions while solving the dynamic lot sizing problem of Wagner–Whitin on a rolling horizon basis. In a rolling horizon environment, managers obtain decisions for the first period (or the first few periods) by looking at the forecasts for several periods. This article develops procedures to find optimal decisions for any specified number of initial periods (called planning horizon in the article) by using the forecast data for the minimum possible number of future periods. Computational results comparing these procedures with the other procedures reported in the literature are very encouraging. 相似文献
505.
Nature of Renyi's entropy and associated divergence function is discussed in terms of concave (convex) and pseudoconcave (pseudoconvex) functions. 相似文献
506.
507.
508.
509.
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. 相似文献
510.
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. 相似文献