全文获取类型
收费全文 | 401篇 |
免费 | 7篇 |
出版年
2021年 | 8篇 |
2019年 | 9篇 |
2018年 | 5篇 |
2017年 | 3篇 |
2016年 | 8篇 |
2015年 | 3篇 |
2014年 | 8篇 |
2013年 | 65篇 |
2012年 | 3篇 |
2009年 | 5篇 |
2008年 | 4篇 |
2007年 | 12篇 |
2005年 | 3篇 |
2004年 | 4篇 |
2003年 | 7篇 |
2002年 | 7篇 |
2000年 | 3篇 |
1999年 | 3篇 |
1998年 | 7篇 |
1997年 | 8篇 |
1996年 | 10篇 |
1995年 | 3篇 |
1994年 | 6篇 |
1993年 | 11篇 |
1992年 | 7篇 |
1991年 | 9篇 |
1990年 | 10篇 |
1989年 | 17篇 |
1988年 | 15篇 |
1987年 | 8篇 |
1986年 | 13篇 |
1985年 | 7篇 |
1984年 | 4篇 |
1983年 | 3篇 |
1982年 | 10篇 |
1981年 | 6篇 |
1980年 | 7篇 |
1979年 | 9篇 |
1978年 | 8篇 |
1977年 | 5篇 |
1976年 | 5篇 |
1975年 | 4篇 |
1974年 | 8篇 |
1973年 | 5篇 |
1972年 | 3篇 |
1971年 | 7篇 |
1970年 | 6篇 |
1969年 | 5篇 |
1967年 | 6篇 |
1948年 | 4篇 |
排序方式: 共有408条查询结果,搜索用时 15 毫秒
301.
This article extends the traditional median problem on a grid to include a diagonal line (e.g., a street). In contrast to the traditional median problem, this generalized problem is nonconvex and nonseparable, invalidating some of the properties on which well-known median-seeking algorithms are based. This work presents an algorithm for finding the median on this generalized grid and discusses the relationship between it and the traditional median. 相似文献
302.
Many organizations providing service support for products or families of products must allocate inventory investment among the parts (or, identically, items) that make up those products or families. The allocation decision is crucial in today's competitive environment in which rapid response and low levels of inventory are both required for providing competitive levels of customer service in marketing a firm's products. This is particularly important in high-tech industries, such as computers, military equipment, and consumer appliances. Such rapid response typically implies regional and local distribution points for final products and for spare parts for repairs. In this article we fix attention on a given product or product family at a single location. This single-location problem is the basic building block of multi-echelon inventory systems based on level-by-level decomposition, and our modeling approach is developed with this application in mind. The product consists of field-replaceable units (i.e., parts), which are to be stocked as spares for field service repair. We assume that each part will be stocked at each location according to an (s, S) stocking policy. Moreover, we distinguish two classes of demand at each location: customer (or emergency) demand and normal replenishment demand from lower levels in the multiechelon system. The basic problem of interest is to determine the appropriate policies (si Si) for each part i in the product under consideration. We formulate an approximate cost function and service level constraint, and we present a greedy heuristic algorithm for solving the resulting approximate constrained optimization problem. We present experimental results showing that the heuristics developed have good cost performance relative to optimal. We also discuss extensions to the multiproduct component commonality problem. 相似文献
303.
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. 相似文献
304.
Lauren R. Heller Robert A. Lawson Ryan H. Murphy Claudia R. Williamson 《Defence and Peace Economics》2018,29(4):355-382
Economic freedom has increased living standards worldwide. Concurrent with such gains are rising concerns about potential human costs associated with free markets. This paper uses data on human trafficking and anti-trafficking policies, in conjunction with a measure of economic freedom, to examine whether free markets exacerbate or attenuate the incidence of human trafficking and policies designed to combat it. We do not find evidence suggesting that economic freedom is associated with human trafficking. In addition, our results suggest that economically free countries are more likely to enact and enforce policies to fight human trafficking. 相似文献
305.
Alan P. Wood 《海军后勤学研究》1988,35(4):461-471
A multistate system is assumed to be constantly monitored; i.e., the state of the system is always known with certainty. Damage to the system accumulates via a continuous-time Markov process. A model of the system including restoration costs and state occupation costs is developed. It is shown that under certain conditions the optimal restoration policy for the system is a control limit rule. A control limit rule is a policy which requires restoration of the system whenever the damage exceeds a certain level. Examples are presented to show that there are several situations in which, perhaps surprisingly, control limit rules are not optimal. 相似文献
306.
On estimating population characteristics from record-breaking observations II. Nonparametric results
Consider an experiment in which only record-breaking values (e.g., values smaller than all previous ones) are observed. The data available may be represented as X1,K1,X2,K2, …, where X1,X2, … are successive minima and K1,K2, … are the numbers of trials needed to obtain new records. Such data arise in life testing and stress testing and in industrial quality-control experiments. When only a single sequence of random records are available, efficient estimation of the underlying distribution F is possible only in a parametric framework (see Samaniego and Whitaker [9]). In the present article we study the problem of estimating certain population quantiles nonparametrically from such data. Furthermore, under the assumption that the process of observing random records can be replicated, we derive and study the nonparametric maximum-likelihood estimator F̂ of F. We establish the strong uniform consistency of this estimator as the number of replications grows large, and identify its asymptotic distribution theory. The performance of F̂ is compared to that of two possible competing estimators. 相似文献
307.
Previous lot-sizing models incorporating learning effects focus exclusively on worker learning. We extend these models to include the presence of setup learning, which occurs when setup costs exhibit a learning curve effect as a function of the number of lots produced. The joint worker/setup learning problem can be solved to optimality by dynamic programming. Computational experience indicates, however, that solution times are sensitive to certain problem parameters, such as the planning horizon and/or the presence of a lower bound on worker learning. We define a two-phase EOQ-based heuristic for the problem when total transmission of worker learning occurs. Numerical results show that the heuristic consistently generates solutions well within 1% of optimality. 相似文献
308.
In this article we present a methodology for postoptimality and sensitivity analysis of zero-one goal programs based on the set of k-best solutions. A method for generating the set of k-best solutions using a branch and bound algorithm and an implicit enumeration scheme for multiple objective problem are discussed. Rules for determining the range of parameter changes that still allows a member of the k-best set to be optimal are developed. An investigation of a sufficient condition for postoptimality analysis is also presented. 相似文献
309.
Kevin D. Glazebrook 《海军后勤学研究》1987,34(3):319-335
In most of the stochastic resource-allocation problems discussed in the literature it is supposed that the key resource, herein called the machine, is continuously available until all tasks are completed. Plainly, this will often be an unrealistic assumption. This paper supposes that intermittent availability of the machine is due to a breakdown proces, and describes various approaches to the evaluation of the effect of breakdowns. Firstly, for the case of geometric up times, conditions are given under which breakdowns have no effect on optimal allocation strategies. Secondly, two different procedures are given which yield an upper bound on the loss incurred when a processing strategy is adopted under the assumption of no breakdowns, when in fact breakdowns do occur. The first of these is based on Gittins's indices and is described for the case of geometric up times, and the second uses a bounding argument on the breakdown process. 相似文献
310.
A method previously devised for the solution of the p-center problem on a network has now been extended to solve the analogous minimax location-allocation problem in continuous space. The essence of the method is that we choose a subset of the n points to be served and consider the circles based on one, two, or three points. Using a set-covering algorithm we find a set of p such circles which cover the points in the relaxed problem (the one with m < n points). If this is possible, we check whether the n original points are covered by the solution; if so, we have a feasible solution to the problem. We now delete the largest circle with radius rp (which is currently an upper limit to the optimal solution) and try to find a better feasible solution. If we have a feasible solution to the relaxed problem which is not feasible to the original, we augment the relaxed problem by adding a point, preferably the one which is farthest from its nearest center. If we have a feasible solution to the original problem and we delete the largest circle and find that the relaxed problem cannot be covered by p circles, we conclude that the latest feasible solution to the original problem is optimal. An example of the solution of a problem with ten demand points and two and three service points is given in some detail. Computational data for problems of 30 demand points and 1–30 service points, and 100, 200, and 300 demand points and 1–3 service points are reported. 相似文献