全文获取类型
收费全文 | 724篇 |
免费 | 13篇 |
出版年
2021年 | 7篇 |
2020年 | 7篇 |
2019年 | 9篇 |
2017年 | 17篇 |
2016年 | 17篇 |
2015年 | 14篇 |
2014年 | 9篇 |
2013年 | 111篇 |
2012年 | 23篇 |
2011年 | 30篇 |
2010年 | 22篇 |
2009年 | 18篇 |
2008年 | 31篇 |
2007年 | 14篇 |
2006年 | 18篇 |
2005年 | 12篇 |
2004年 | 10篇 |
2003年 | 6篇 |
2002年 | 5篇 |
1999年 | 6篇 |
1998年 | 8篇 |
1997年 | 7篇 |
1996年 | 9篇 |
1995年 | 7篇 |
1994年 | 11篇 |
1993年 | 13篇 |
1992年 | 11篇 |
1991年 | 18篇 |
1989年 | 17篇 |
1988年 | 6篇 |
1987年 | 17篇 |
1986年 | 19篇 |
1985年 | 19篇 |
1983年 | 8篇 |
1982年 | 6篇 |
1981年 | 9篇 |
1980年 | 12篇 |
1979年 | 13篇 |
1978年 | 7篇 |
1977年 | 11篇 |
1976年 | 10篇 |
1975年 | 8篇 |
1974年 | 7篇 |
1972年 | 19篇 |
1971年 | 8篇 |
1970年 | 10篇 |
1969年 | 13篇 |
1968年 | 11篇 |
1967年 | 6篇 |
1966年 | 6篇 |
排序方式: 共有737条查询结果,搜索用时 15 毫秒
641.
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. 相似文献
642.
Nature of Renyi's entropy and associated divergence function is discussed in terms of concave (convex) and pseudoconcave (pseudoconvex) functions. 相似文献
643.
An optimization model which is frequently used to assist decision makers in the areas of resource scheduling, planning, and distribution is the minimum cost multiperiod network flow problem. This model describes network structure decision-making problems over time. Such problems arise in the areas of production/distribution systems, economic planning, communication systems, material handling systems, traffic systems, railway systems, building evacuation systems, energy systems, as well as in many others. Although existing network solution techniques are efficient, there are still limitations to the size of problems that can be solved. To date, only a few researchers have taken the multiperiod structure into consideration in devising efficient solution methods. Standard network codes are usually used because of their availability and perceived efficiency. In this paper we discuss the development, implementation, and computational testing of a new technique, the forward network simplex method, for solving linear, minimum cost, multiperiod network flow problems. The forward network simplex method is a forward algorithm which exploits the natural decomposition of multiperiod network problems by limiting its pivoting activity. A forward algorithm is an approach to solving dynamic problems by solving successively longer finite subproblems, terminating when a stopping rule can be invoked or a decision horizon found. Such procedures are available for a large number of special structure models. Here we describe the specialization of the forward simplex method of Aronson, Morton, and Thompson to solving multiperiod network network flow problems. Computational results indicate that both the solution time and pivot count are linear in the number of periods. For standard network optimization codes, which do not exploit the multiperiod structure, the pivot count is linear in the number of periods; however, the solution time is quadratic. 相似文献
644.
645.
646.
647.
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. 相似文献
648.
In this article we present an optimum maintenance policy for a group of machines subject to stochastic failures where the repair cost and production loss due to the breakdown of machines are minimized. A nomograph was developed for machines with exponential failure time distributions. The optimal schedule time for repair as well as the total repair cost per cycle can be obtained easily from the nomograph. Conditions for the existence of a unique solution for the optimum schedule and the bounds for the schedule are discussed. 相似文献
649.
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. 相似文献
650.
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. 相似文献