全文获取类型
收费全文 | 640篇 |
免费 | 11篇 |
出版年
2021年 | 11篇 |
2019年 | 15篇 |
2018年 | 9篇 |
2017年 | 7篇 |
2016年 | 9篇 |
2015年 | 5篇 |
2014年 | 9篇 |
2013年 | 101篇 |
2010年 | 5篇 |
2009年 | 7篇 |
2008年 | 7篇 |
2007年 | 14篇 |
2004年 | 9篇 |
2003年 | 11篇 |
2002年 | 9篇 |
2001年 | 6篇 |
2000年 | 7篇 |
1998年 | 12篇 |
1997年 | 12篇 |
1996年 | 17篇 |
1995年 | 6篇 |
1994年 | 8篇 |
1993年 | 13篇 |
1992年 | 12篇 |
1991年 | 14篇 |
1990年 | 12篇 |
1989年 | 25篇 |
1988年 | 22篇 |
1987年 | 14篇 |
1986年 | 19篇 |
1985年 | 13篇 |
1984年 | 9篇 |
1983年 | 5篇 |
1982年 | 14篇 |
1981年 | 11篇 |
1980年 | 16篇 |
1979年 | 12篇 |
1978年 | 12篇 |
1977年 | 9篇 |
1976年 | 10篇 |
1975年 | 10篇 |
1974年 | 12篇 |
1973年 | 7篇 |
1972年 | 6篇 |
1971年 | 13篇 |
1970年 | 9篇 |
1969年 | 8篇 |
1968年 | 6篇 |
1967年 | 10篇 |
1966年 | 6篇 |
排序方式: 共有651条查询结果,搜索用时 0 毫秒
481.
This paper describes the Value Added Analysis methodology which is used as part of the U.S. Army's Planning, Programming, Budgeting, and Execution System to assist the Army leadership in evaluating and prioritizing competing weapon system alternatives during the process of building the Army budget. The Value Added Analysis concept uses a family of models to estimate an alternative system's contribution to the Army's effectiveness using a multiattribute value hierarchy. A mathematical optimization model is then used to simultaneously determine an alternative's cost‐benefit and to identify an optimal mix of weapon systems for inclusion in the Army budget. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 233–253, 1999 相似文献
482.
In this paper the inventory problem with backorders both deterministic and stochastic is studied using trade-off analysis in the context of vector optimization theory. The set of Pareto-optimal solutions is geometrically characterized in both the constrained and unconstrained cases. Moreover, a new way of utilizing Pareto-optimality concepts to handle classical inventory problems with backorders is derived. A new analysis of these models is done by means of a trade-off analysis. New solutions are shown, and an error bound for total inventory cost is provided. Other models such as multi-item or stochastic lead-time demand inventory problems are addressed and their Pareto-optimal solution sets are obtained. An example is included showing the additional applicability of this kind of analysis to handle parametric problems. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 83–98, 1998 相似文献
483.
In this article we present a novel technique for deriving the convex envelope of certain nonconvex fixed-charge functions of the type that arise in several related applications that have been considered in the literature. One common attribute of these problems is that they involve choosing levels for the undertaking of several activities. Two or more activities share a common resource, and a fixed charge is incurred when any of these activities is undertaken at a positive level. We consider nonconvex programming formulations for these problems in which the fixed charges are expressed in the form of concave functions. With the use of the developed convex envelope results, we show that the convex envelope relaxations of the nonconvex formulations lead to the linear programming relaxations of the strong IP/MIP formulations of these problems. Moreover, our technique for deriving convex envelopes offers a useful construct that could be exploited in other related contexts as well. © 1996 John Wiley & Sons, Inc. 相似文献
484.
We describe a modification of Brown's fictitious play method for solving matrix (zero-sum two-person) games and apply it to both symmetric and general games. If the original game is not symmetric, the basic idea is to transform the given matrix game into an equivalent symmetric game (a game with a skew-symmetric matrix) and use the solution properties of symmetric games (the game value is zero and both players have the same optimal strategies). The fictitious play method is then applied to the enlarged skew-symmetric matrix with a modification that calls for the periodic restarting of the process. At restart, both players' strategies are made equal based on the following considerations: Select the maximizing or minimizing player's strategy that has a game value closest to zero. We show for both symmetric and general games, and for problems of varying sizes, that the modified fictitious play (MFP) procedure approximates the value of the game and optimal strategies in a greatly reduced number of iterations and in less computational time when compared to Brown's regular fictitious play (RFP) method. For example, for a randomly generated 50% dense skew-symmetric 100 × 100 matrix (symmetric game), with coefficients |aij| ≤ 100, it took RFP 2,652,227 iterations to reach a gap of 0.03118 between the lower and upper bounds for the game value in 70.71 s, whereas it took MFP 50,000 iterations to reach a gap of 0.03116 in 1.70 s. Improved results were also obtained for general games in which the MFP solves a much larger equivalent symmetric game. © 1996 John Wiley & Sons, Inc. 相似文献
485.
Items are characterized by a set of attributes (T) and a collection of covariates (X) associated with those attributes. We wish to screen for acceptable items (T ∈ CT), but T is expensive to measure. We envisage a two-stage screen in which observation of X_ is used as a filter at the first stage to sentence most items. The second stage involves the observation of T for those items for which the first stage is indecisive. We adopt a Bayes decision-theoretic approach to the development of optimal two-stage screens within a general framework for costs and stochastic structure. We also consider the important question of how much screens need to be modified in the light of resource limitations that bound the proportion of items that can be passed to the second stage. © 1996 John Wiley & Sons, Inc. 相似文献
486.
The classical work of Gittins, which resulted in the celebrated index result, had applications to research planning as an important part of its motivation. However, research planning problems often have features that are not accommodated within Gittins's original framework. These include precedence constraints on the task set, influence between tasks, stopping or investment options and routes to success in which some tasks do not feature. We consider three classes of Markovian decision models for research planning, each of which has all of these features. Gittins-index heuristics are proposed and are assessed both analytically and computationally. They perform impressively. © 1995 John Wiley & Sons, Inc. 相似文献
487.
For infinite-horizon replacement economy problems it is common practice to truncate the problem at some finite horizon. We develop bounds on the error due to such a truncation. These bounds differ from previous results in that they include both revenues and costs. Bounds are illustrated through a numerical example from a real case in vehicle replacement. © 1994 John Wiley & Sons, Inc. 相似文献
488.
The article presents a Bayesian analysis for the environmental stress screening problem. The decision problem of deriving optimal stress screen durations is solved. Given a screen duration, the optimal stress level can also be determined. Indicators of the quality of a screen of any duration are derived. A statistical model is presented which allows a posterior density for the rate of early failures of the production process to be calculated. This enables the user to update his opinion about the quality of the process. © 1994 John Wiley & Sons, Inc. 相似文献
489.
Consider a closed network of queues of the “product-form” type, where each station has s servers (s ≥ 1 is identical for all stations). We show that the throughput function of the network is Schur concave with respect to the loading of the stations and arrangement increasing with respect to the assignment of server groups. Consequently, different loading/assignment policies can be compared under majorization/arrangement orderings and their relative merits decided according to the yields of throughput. The results can be used to support planning decisions in computer and production systems which are modeled as closed networks of queues. 相似文献
490.
The maintenance strategy considered in this article is in the class of block replacement policies. The working unit is replaced by new ones at instants T,2T,3T,… independently of the age and state of the unit. If a failure occurs between these instants, the random repair cost is evaluated. If it is smaller than a predetermined control limit then a minimal repair is carried out. Otherwise the unit is replaced by a used unit. The performance of this maintenance strategy is evaluated in terms of average total cost per time unit over an infinite time span. The mathematical model is defined and several analytical results are obtained. A computer program has been written, which solves the mathematical problem, and some examples are given for the cases where the underlying life distribution is gamma, Weibull or truncated normal. 相似文献