全文获取类型
收费全文 | 572篇 |
免费 | 13篇 |
出版年
2021年 | 6篇 |
2019年 | 13篇 |
2018年 | 9篇 |
2017年 | 11篇 |
2016年 | 9篇 |
2015年 | 9篇 |
2013年 | 105篇 |
2010年 | 5篇 |
2009年 | 9篇 |
2008年 | 10篇 |
2006年 | 5篇 |
2005年 | 8篇 |
2004年 | 12篇 |
2003年 | 8篇 |
2002年 | 5篇 |
2001年 | 5篇 |
2000年 | 7篇 |
1999年 | 5篇 |
1998年 | 7篇 |
1997年 | 6篇 |
1996年 | 17篇 |
1995年 | 7篇 |
1994年 | 9篇 |
1993年 | 7篇 |
1992年 | 11篇 |
1991年 | 18篇 |
1990年 | 7篇 |
1989年 | 12篇 |
1988年 | 12篇 |
1987年 | 14篇 |
1986年 | 16篇 |
1985年 | 18篇 |
1984年 | 9篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1981年 | 6篇 |
1980年 | 12篇 |
1979年 | 6篇 |
1978年 | 9篇 |
1977年 | 9篇 |
1976年 | 9篇 |
1975年 | 7篇 |
1974年 | 8篇 |
1972年 | 11篇 |
1971年 | 12篇 |
1970年 | 11篇 |
1969年 | 8篇 |
1968年 | 9篇 |
1967年 | 9篇 |
1966年 | 9篇 |
排序方式: 共有585条查询结果,搜索用时 156 毫秒
511.
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. 相似文献
512.
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. 相似文献
513.
514.
515.
516.
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. 相似文献
517.
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. 相似文献
518.
It is proposed to describe multiple air-to-air combat having a moderate number of participants with the aid of a stochastic process based on end-game duels. A simple model describing the dominant features of air combat leads to a continuous time discrete-state Markov process. Solution of the forward Kolmogorov equations enables one to investigate the influence of initial force levels and performance parameters on the outcome probabilities of the multiple engagement. As is illustrated, such results may be useful in the decision-making process for aircraft and weapon system development planning. Some comparisons are made with Lanchester models as well as with a semi-Markov model. 相似文献
519.
Under fairly general conditions, a nonlinear fractional program, where the function to be maximized has the form f(x)/g(x), is shown to be equivalent to a nonlinear program not involving fractions. The latter program is not generally a convex program, but there is often a convex program equivalent to it, to which the known algorithms for convex programming may be applied. An application to duality of a fractional program is discussed. 相似文献
520.