全文获取类型
收费全文 | 450篇 |
免费 | 5篇 |
出版年
2021年 | 5篇 |
2020年 | 4篇 |
2019年 | 4篇 |
2017年 | 10篇 |
2016年 | 10篇 |
2015年 | 8篇 |
2014年 | 8篇 |
2013年 | 55篇 |
2012年 | 22篇 |
2011年 | 26篇 |
2010年 | 21篇 |
2009年 | 14篇 |
2008年 | 27篇 |
2007年 | 13篇 |
2006年 | 15篇 |
2005年 | 5篇 |
2004年 | 3篇 |
2002年 | 3篇 |
2001年 | 3篇 |
1999年 | 2篇 |
1998年 | 6篇 |
1997年 | 6篇 |
1995年 | 5篇 |
1994年 | 4篇 |
1993年 | 10篇 |
1992年 | 7篇 |
1991年 | 6篇 |
1990年 | 2篇 |
1989年 | 12篇 |
1988年 | 3篇 |
1987年 | 10篇 |
1986年 | 10篇 |
1985年 | 7篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1981年 | 8篇 |
1980年 | 9篇 |
1979年 | 11篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 7篇 |
1975年 | 7篇 |
1974年 | 2篇 |
1973年 | 2篇 |
1972年 | 12篇 |
1971年 | 3篇 |
1970年 | 3篇 |
1969年 | 9篇 |
1968年 | 7篇 |
1966年 | 3篇 |
排序方式: 共有455条查询结果,搜索用时 15 毫秒
431.
This paper examines problems of sequencing n jobs for processing by a single resource to minimize a function of job completion times, when the availability of the resource varies over time. A number of well-known results for single-machine problems which can be applied with little or no modification to the corresponding variable-resource problems are given. However, it is shown that the problem of minimizing the weighted sum of completion times provides an exception. 相似文献
432.
During basis reinversion of either a product form or elimination form linear programming system, it may become necessary to swap spike columns to effect the reinversion and maintain the desired sparsity characteristics. This note shows that the only spikes which need be examined when an interchange is required are those not yet processed in the current external bump. 相似文献
433.
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. 相似文献
434.
We consider the stochastic linear knapsack problem in which costs are known with certainty but returns are independent, normally distributed random variables. The objective is to maximize the probability that the overall return equals or exceeds a specified target value. A previously proposed preference order dynamic programming-based algorithm has been shown to be potentially suboptimal. We offer an alternative hybrid DP/branch-and-bound algorithm that both guarantees optimality and significantly outperforms generating the set of Pareto optimal returns.© 1993 John Wiley & Sons, Inc. 相似文献
435.
436.
437.
438.
We present techniques for classifying Markov chains with a continuous state space as either ergodic or recurrent. These methods are analogous to those of Foster for countable space chains. The theory is presented in the first half of the paper, while the second half consists of examples illustrating these techniques. The technique for proving ergodicity involves, in practice, three steps: showing that the chain is irreducible in a suitable sense; verifying that the mean hitting times on certain (usually bounded) sets are bounded, by using a “mean drift” criterion analogous to that of Foster; and finally, checking that the chain is such that bounded mean hitting times for these sets does actually imply ergodicity. The examples comprise a number of known and new results: using our techniques we investigate random walks, queues with waiting-time-dependent service times, dams with general and random-release rules, the s-S inventory model, and feedback models. 相似文献
439.
This paper considers real-time decision rules for an inventory system where items are repaired than “used up.” The problem is to decide which user in the system has the greatest need for the newly available inventory items coming out of repair. The main result shows that two published approahes, the Transportation Time Look Ahead policy and METRIC, are optimal when the number of users gets large. A useful byproduct of the proof is a lower bound on the average backorder rate for a repair-inventory system of any size. 相似文献
440.
We describe the application of a decomposition based solution method to a class of network interdiction problems. The problem of maximizing the probability of sufficient disruption of the flow of information or goods in a network whose characteristics are not certain is shown to be solved effectively by applying a scenario decomposition method developed by Riis and Schultz [Comput Optim Appl 24 (2003), 267–287]. Computational results demonstrate the effectiveness of the algorithm and design decisions that result in speed improvements. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献