全文获取类型
收费全文 | 979篇 |
免费 | 24篇 |
出版年
2021年 | 16篇 |
2019年 | 31篇 |
2018年 | 14篇 |
2017年 | 26篇 |
2016年 | 21篇 |
2015年 | 24篇 |
2014年 | 23篇 |
2013年 | 197篇 |
2011年 | 8篇 |
2010年 | 9篇 |
2009年 | 14篇 |
2007年 | 11篇 |
2006年 | 11篇 |
2005年 | 16篇 |
2004年 | 18篇 |
2003年 | 10篇 |
2002年 | 14篇 |
2000年 | 12篇 |
1999年 | 10篇 |
1998年 | 18篇 |
1997年 | 20篇 |
1996年 | 15篇 |
1994年 | 23篇 |
1993年 | 15篇 |
1992年 | 12篇 |
1991年 | 23篇 |
1990年 | 11篇 |
1989年 | 19篇 |
1988年 | 20篇 |
1987年 | 24篇 |
1986年 | 23篇 |
1985年 | 17篇 |
1984年 | 13篇 |
1983年 | 14篇 |
1982年 | 13篇 |
1981年 | 12篇 |
1980年 | 11篇 |
1979年 | 17篇 |
1978年 | 17篇 |
1977年 | 10篇 |
1976年 | 14篇 |
1975年 | 12篇 |
1974年 | 14篇 |
1973年 | 17篇 |
1972年 | 13篇 |
1971年 | 9篇 |
1970年 | 15篇 |
1969年 | 12篇 |
1968年 | 9篇 |
1967年 | 11篇 |
排序方式: 共有1003条查询结果,搜索用时 15 毫秒
211.
Richard M. Soland 《海军后勤学研究》1973,20(2):325-340
We present a branch and bound algorithm to solve mathematical programming problems of the form: Find x =|(x1,…xn) to minimize Σ?i0(x1) subject to x?G, l≦x≦L and Σ?i0(x1)≦0, j=1,…,m. With l=(l1,…,ln) and L=(L1,…,Ln), each ?ij is assumed to be lower aemicontinuous and piecewise convex on the finite interval [li.Li]. G is assumed to be a closed convex set. The algorithm solves a finite sequence of convex programming problems; these correspond to successive partitions of the set C={x|l ≦ x ≦L} on the bahis of the piecewise convexity of the problem functions ?ij. Computational considerations are discussed, and an illustrative example is presented. 相似文献
212.
The paper deals with bilinear programming problems and develops a finite algorithm using the “piecewise strategy” for large-scale systems. It consists of systematically generating a sequence of expanding polytopes with the global optimum within each polytope being known. The procedure then stops when the final polytope contains the feasible region. 相似文献
213.
An inventory model in which future demand is affected by stockouts has been considered recently by B. L. Schwartz. Some generalizations of Schwartz's model are presented in this paper and properties of the optimal policies are determined. In the case of deterministic demand, a set-up cost is included and a mixture of backlogged and nonbacklogged orders is allowed during stockout. It is proved that the optimal policy entails either no stockout or continual stockout, depending on the values of three parameters. For stochastic demand, the effect of stockouts on demand density is postulated, the resulting optimal inventory policy is discussed, and an example involving an exponential density function is then analyzed in detail. 相似文献
214.
Many techniques of forecasting are based upon extrapolation from time series. While such techniques have useful applications, they entail strong assumptions which are not explicitly enunciated. Furthermore, the time series approach not based on an indigenous forecast principle. The first attack from the present point of view was initiated by S. S. Wilks. Of particular interest over a wide range of operational situations in reliability, for example, is the behavior of the extremes of the Weibull and Gumbel distributions. Here we formulate forecasters for the minima of various forms of these distributions. The forecasters are determined for minimization in mean square of the distance. From n original observations the forecaster provides the minimum of the next m observations when the original distribution is maintained. For each of the forecasters developed, tables of efficiency have been calculated and included in the appendix. An explicit example has been included for one of the forecasters. Its performance has been demonstrated by the use of Monte Carlo technique. The results indicate that the forecaster can be used in practice with satisfactory results. 相似文献
215.
A stochastically constrained optimal replacement model for capital equipment is constructed. Each piece of capital equipment, or machine, is characterized by its age and “utility” or “readiness” class. The readiness of a machine at any age is a stochastic function of its initial utility class and its age. The total discounted replacement cost of several replacement streams, each commencing with an initial machine, is minimized with respect to the replacement age and initial utility class of each machine, subject to a readiness constraint stating the lower bound on the expected number of machines in each utility class at any time. A general solution procedure is outlined and a specific case is solved in detail. 相似文献
216.
This paper develops bounds on the uncertainties in system availabilities or reliabilities which have been computed from structural (series, parallel, etc.) relations among uncertain subsystem availabilities or reliabilities. It is assumed that the highly available (reliable) subsystems have been tested or simulated to determine their unavailabilities (unreliabilities) to within some small percentages of uncertainty. It is shown that series, parallel and r out of n structures which are nominally highly available will have unavailability uncertainties whose percentages errors are of the same order as the subsystem uncertainties. Thus overall system analysis errors, even for large systems, are of the same order of magnitude as the uncertainties in the component probabilities. Both systematic (bias type) uncertainties and independent random uncertainties are considered. 相似文献
217.
Alan J. Kaplan 《海军后勤学研究》1976,23(4):687-695
We address a single product, continuous review model with stationary Poisson demand. Such a model has been effectively studied when mean demand is known. However, we are concerned with managing new items for which only a Bayesian prior distribution on the mean is available. As demand occurs, the prior is updated and our control parameters are revised. These include the reorder point (R) and reorder quantity (Q). Deemer, taking a clue from some earlier RAND work, suggested using a model appropriate for known mean, but using a Compound Poisson distribution for demand rather than Poisson to reflect uncertainty about the mean. Brown and Rogers also used this approach but within a periodic review context. In this paper we show how to compute optimum reorder points for a special problem closely related to the problem of real interest. In terms of the real problem, subject to a qualification to be discussed, the reorder points found are upper bounds for the optimum. At the same time, the reorder points found can never exceed those found by the Compound Poisson (Deemer) approach. And they can be smaller than those found when there is no uncertainty about the mean. As a check, the Compound Poisson and proposed approach are compared by simulation. 相似文献
218.
The problem of finding minimal disconnecting sets for multi-commodity directed networks may be solved using an arc-path formulation and Gomory's all-integer integer programming algorithm. However, the number of network constraints may be astronomical for even moderately sized networks. This paper develops a finite algorithm similar to Gomory's, but requiring no more than m rows in the tableau, where m is the number of arcs in the network. 相似文献
219.
220.
A set of edges D called an isolation set, is said to isolate a set of nodes R from an undirected network if every chain between the nodes in R contains at least one edge from the set D. Associated with each edge of the network is a positive cost. The isolation problem is concerned with finding an isolation set such that the sum of its edge costs is a minimum. This paper formulates the problem of determining the minimal cost isolation as a 0–1 integer linear programming problem. An algorithm is presented which applies a branch and bound enumerative scheme to a decomposed linear program whose dual subproblems are minimal cost network flow problems. Computational results are given. The problem is also formulated as a special quadratic assignment problem and an algorithm is presented that finds a local optimal solution. This local solution is used for an initial bound. 相似文献