全文获取类型
收费全文 | 3448篇 |
免费 | 86篇 |
国内免费 | 1篇 |
专业分类
3535篇 |
出版年
2021年 | 38篇 |
2019年 | 91篇 |
2018年 | 58篇 |
2017年 | 81篇 |
2016年 | 83篇 |
2015年 | 63篇 |
2014年 | 69篇 |
2013年 | 750篇 |
2010年 | 38篇 |
2009年 | 40篇 |
2008年 | 50篇 |
2007年 | 53篇 |
2006年 | 37篇 |
2005年 | 46篇 |
2004年 | 56篇 |
2003年 | 45篇 |
2002年 | 59篇 |
1999年 | 42篇 |
1998年 | 46篇 |
1997年 | 49篇 |
1996年 | 64篇 |
1995年 | 43篇 |
1994年 | 62篇 |
1993年 | 64篇 |
1992年 | 59篇 |
1991年 | 74篇 |
1990年 | 40篇 |
1989年 | 73篇 |
1988年 | 80篇 |
1987年 | 70篇 |
1986年 | 71篇 |
1985年 | 65篇 |
1984年 | 38篇 |
1983年 | 42篇 |
1982年 | 43篇 |
1981年 | 46篇 |
1980年 | 51篇 |
1979年 | 46篇 |
1978年 | 49篇 |
1977年 | 45篇 |
1976年 | 46篇 |
1975年 | 47篇 |
1974年 | 52篇 |
1973年 | 50篇 |
1972年 | 52篇 |
1971年 | 43篇 |
1970年 | 41篇 |
1969年 | 40篇 |
1968年 | 34篇 |
1967年 | 34篇 |
排序方式: 共有3535条查询结果,搜索用时 0 毫秒
791.
John E. Angus 《海军后勤学研究》1987,34(6):845-851
The confidence coefficient of a two-sided confidence interval for the binomial parameter p is the infimum of the coverage probability of the interval as p ranges between 0 and 1. The confidence coefficients for five different approximate confidence intervals are computed and compared to the confidence coefficient for the two-sided Clopper-Pearson confidence interval. Pratt's approximation method [10] yields virtually the same confidence coefficients as the Clopper-Pearson interval, and is easily computed without resorting to interative methods. 相似文献
792.
James N. Eagle 《海军后勤学研究》1987,34(1):43-51
The problem addressed is that of estimating the probability of a moving particle (called the target) avoiding detection by a stationary sensor to time t. The target follows a diffusion path and is constrained to remain within a square region R. The detecting sensor is fixed at the center of A. Two expressions for this probability are given. The first results from an approximation to the exact solution of the diffusion equation and the second from experimentation with a Monte Carlo simulation of the diffusion process. 相似文献
793.
We consider the multiperiod lot-sizing problem in which the production yield (the proportion of usable goods) is variable according to a known probability distribution. We review two economic order quantity (EOQ) models for the stationary demand continuous-time problem and derive an EOQ model when the production yield follows a binomial distribution and backlogging of demand is permitted. A dynamic programming algorithm for an arbitrary sequence of demand requirements is presented. Heuristics based on both the EOQ model and appropriate modification of the underlying perfect-yield lot-sizing policies are discussed, and extensive computational evaluation of these heuristics is presented. Two of these heuristics are then modified to include the notion of supply safety stock. The modified heuristics consistently produce near-optimal lot-sizing policies for problems with stationary and time-varying demands. 相似文献
794.
Warren B. Powell 《海军后勤学研究》1987,34(2):207-227
Procedures are developed for numerically calculating the waiting-time distribution for bulk arrival, bulk service queues operated under a vehicle-cancellation or a vehicle-holding strategy, as well as for queues where vehicles depart regardless of the length of the queue. Experiments indicate that the mean and variance of the calculated distribution agree very closely with analytical expressions obtained from transforms. The results can be used to study the service reliability of different dispatching strategies. Alternatively, the results may be used to evaluate simpler approximations for the higher moments. 相似文献
795.
796.
797.
798.
Multi-echelon logistic systems are essential parts of the service support function of high technology firms. The combination of technological developments and competitive pressures has led to the development of services systems with a unique set of characteristics. These characteristics include (1) low demand probabilities: (2) high cost items; (3) complex echelon structures; (4) existence of pooling mechanisms among stocking locations at the same echelon level; (5) high priority for service, which is often expressed in terms of response time service levels for product groups of items: (6) scrapping of failed parts; and (7) recycling of issued stock due to diagnostic use. This article develops a comprehensive model of a stochastic, multi-echelon inventory system that takes account of the above characteristics. Solutions to the constrained optimization problem are found using a branch and bound procedure. The results of applying this procedure to a spare parts inventory system for a computer manufacturer have led to a number of important policy conclusions. 相似文献
799.
We present variants of a convergent Lagrangean relaxation algorithm for minimizing a strictly convex separable quadratic function over a transportation polytope. The algorithm alternately solves two “subproblems,” each of which has an objective function that is defined by using Lagrange multipliers derived from the other. Motivated by the natural separation of the subproblems into independent and very easily solved “subsubproblems,” the algorithm can be interpreted as the cyclic coordinate ascent method applied to the dual problem. We exhibit our computational results for different implementations of the algorithm applied to a set of large constrained matrix problems. 相似文献
800.
In many decision-making situations, each activity that can be undertaken may have associated with it both a fixed and a variable cost. Recently, we have encountered serveral practical problems in which the fixed cost of undertaking an activity depends upon which other activities are also undertaken. To our knowledge, no existing optimization model can accomodate such a fixed cost structure. To do so, we have therefore developed a new model called the interactive fixed charge linear programming problem (IFCLP). In this paper we present and motivate problem (IFCLP), study some of its characteristics, and present a finite branch and bound algorithm for solving it. We also discuss the main properties of this algorithm. 相似文献