全文获取类型
收费全文 | 756篇 |
免费 | 25篇 |
国内免费 | 1篇 |
出版年
2021年 | 15篇 |
2019年 | 27篇 |
2018年 | 14篇 |
2017年 | 16篇 |
2016年 | 16篇 |
2015年 | 15篇 |
2014年 | 15篇 |
2013年 | 151篇 |
2012年 | 7篇 |
2011年 | 7篇 |
2009年 | 8篇 |
2008年 | 8篇 |
2007年 | 9篇 |
2006年 | 9篇 |
2005年 | 11篇 |
2004年 | 10篇 |
2003年 | 9篇 |
2002年 | 9篇 |
2000年 | 9篇 |
1998年 | 10篇 |
1997年 | 17篇 |
1996年 | 12篇 |
1994年 | 14篇 |
1993年 | 11篇 |
1992年 | 10篇 |
1991年 | 20篇 |
1990年 | 6篇 |
1989年 | 13篇 |
1988年 | 12篇 |
1987年 | 17篇 |
1986年 | 14篇 |
1985年 | 15篇 |
1984年 | 10篇 |
1983年 | 13篇 |
1982年 | 12篇 |
1981年 | 9篇 |
1980年 | 14篇 |
1979年 | 15篇 |
1978年 | 13篇 |
1977年 | 10篇 |
1976年 | 14篇 |
1975年 | 18篇 |
1974年 | 12篇 |
1973年 | 19篇 |
1972年 | 11篇 |
1971年 | 10篇 |
1970年 | 11篇 |
1969年 | 8篇 |
1968年 | 9篇 |
1967年 | 8篇 |
排序方式: 共有782条查询结果,搜索用时 15 毫秒
31.
32.
A transportation system has N vehicles with no capacity constraint which take passengers from a depot to various destinations and return to the depot. The trip times are considered to be independent and identically distributed random variables. The dispatch strategy at the depot is to dispatch immediately, or to hold any returning vehicles with the objective of minimizing the average wait per passenger at the depot, if passengers arrive at a uniform rate. Optimal control strategies and resulting waits are determined in the special case of exponentially distributed trip time for various N up to N = 15. For N ? 1, the nature of the solution is always to keep a reservoir of vehicles in the depot, and to decrease (increase) the time headway between dispatches as the size of the reservoir gets larger (smaller). For sufficiently large N, one can approximate the number of vehicles in the reservoir by a continuum and obtain analytic experession for the optimal dispatch rate as a function of the number of vehicles in the reservoir. For the optimal strategy, it is shown that the average number of vehicles in the depot is of order N1/3. These limit properties are expected to be quite insensitive to the actual trip time distribution, but the convergence of the exact properties to the continuum approximation as N → ∞ is very slow. 相似文献
33.
The existing literature concentrates on determining sharp upper bounds for EVPI in stochastic programming problems. This seems to be a problem without an application. Lower bounds, which we view as having an important application, are only the incidental subject of study and in the few instances that are available are obtained at an extremely high cost. In order to suggest a rethinking of the course of this research, we analyze the need for bounds on EVPI in the context of its significance in decision problems. 相似文献
34.
In this paper we address the question of deriving deep cuts for nonconvex disjunctive programs. These problems include logical constraints which restrict the variables to at least one of a finite number of constraint sets. Based on the works of Balas. Glover, and Jeroslow, we examine the set of valid inequalities or cuts which one may derive in this context, and defining reasonable criteria to measure depth of a cut we demonstrate how one may obtain the “deepest” cut. The analysis covers the case where each constraint set in the logical statement has only one constraint and is also extended for the case where each of these constraint sets may have more than one constraint. 相似文献
35.
The fixed charge problem is a mixed integer mathematical programming problem which has proved difficult to solve in the past. In this paper we look at a special case of that problem and show that this case can be solved by formulating it as a set-covering problem. We then use a branch-and-bound integer programming code to solve test fixed charge problems using the setcovering formulation. Even without a special purpose set-covering algorithm, the results from this solution procedure are dramatically better than those obtained using other solution procedures. 相似文献
36.
The bounded interval generalized assignment model is a “many-for-one” assignment model. Each task must be assigned to exactly one agent; however, each agent can be assigned multiple tasks as long as the agent resource consumed by performing the assigned tasks falls within a specified interval. The bounded interval generalized assignment model is formulated, and an algorithm for its solution is developed. Algorithms for the bounded interval versions of the semiassignment model and sources-to-uses transportation model are also discussed. 相似文献
37.
Consider a birth and death process starting in state 0. Keilson has shown by analytical arguments that the time of first passage into state n has an increasing failure rate (IFR) distribution. We present a probabilistic proof for this. In addition, our proof shows that for a nonnegative diffusion process, the first passage time from state 0 to any state x is IFR. 相似文献
38.
39.
M. Mazumdar 《海军后勤学研究》1982,29(3):411-418
We compare several competing estimates of the availability of a system which alternates between two states, “up” and “down,” in accordance with an alternating renewal process. Both interval and point estimators are compared under several special but representative situations. The comparison reaffirms the validity and robustness of the log-logistic jackknifed estimates. However, when the point estimates are compared from the intrinsic criterion of probability of concentration, the uniformly minimum variance estimate obtained for the Markov model performs very well. 相似文献
40.
Under a free-replacement warranty of duration W, the customer is provided, for an initial cost of C, as many replacement items as needed to provide service for a period W. Payments of C are not made at fixed intervals of length W, but in random cycles of length Y = W + γ(W), where γ(W) is the (random) remaining life-time of the item in service W time units after the beginning of a cycle. The expected number of payments over the life cycle, L, of the item is given by MY(L), the renewal function for the random variable Y. We investigate this renewal function analytically and numerically and compare the latter with known asymptotic results. The distribution of Y, and hence the renewal function, depends on the underlying failure distribution of the items. Several choices for this distribution, including the exponential, uniform, gamma and Weibull, are considered. 相似文献