全文获取类型
收费全文 | 507篇 |
免费 | 19篇 |
出版年
2019年 | 8篇 |
2017年 | 9篇 |
2016年 | 12篇 |
2015年 | 10篇 |
2014年 | 10篇 |
2013年 | 112篇 |
2011年 | 5篇 |
2009年 | 5篇 |
2008年 | 4篇 |
2007年 | 6篇 |
2005年 | 5篇 |
2004年 | 8篇 |
2003年 | 4篇 |
2002年 | 6篇 |
2001年 | 7篇 |
2000年 | 4篇 |
1999年 | 7篇 |
1998年 | 11篇 |
1997年 | 9篇 |
1996年 | 9篇 |
1995年 | 12篇 |
1994年 | 12篇 |
1993年 | 13篇 |
1992年 | 16篇 |
1991年 | 14篇 |
1990年 | 8篇 |
1989年 | 5篇 |
1988年 | 12篇 |
1987年 | 10篇 |
1986年 | 5篇 |
1985年 | 11篇 |
1984年 | 9篇 |
1983年 | 6篇 |
1982年 | 6篇 |
1981年 | 10篇 |
1980年 | 7篇 |
1979年 | 15篇 |
1978年 | 7篇 |
1977年 | 5篇 |
1976年 | 7篇 |
1975年 | 8篇 |
1974年 | 7篇 |
1973年 | 8篇 |
1972年 | 11篇 |
1971年 | 6篇 |
1970年 | 4篇 |
1969年 | 5篇 |
1968年 | 5篇 |
1967年 | 7篇 |
1966年 | 4篇 |
排序方式: 共有526条查询结果,搜索用时 15 毫秒
21.
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. 相似文献
22.
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. 相似文献
23.
A method is developed for determining the optimal policy for entry of customers from many independent classes of Poisson arrivals to a first-come, first-serve (for customers admitted to the queue) single-server queue with exponential service times. The solution technique utilizes a semi-Markov formulation or the decision problem. 相似文献
24.
25.
26.
Robert C. Leachman 《海军后勤学研究》1982,29(1):47-54
Production planning for large-scale production systems requiring the allocation of numerous resources is considered. It is demonstrated how the dynamic activity analysis developed by Shephard leads to linear programming solutions of production planning problems. Three types of planning problems are formulated: maximization of output levels for a given time horizon; minimization of production duration for given output histories; and minimization of production costs for given output histories. 相似文献
27.
New closure theorems for shock models in reliability theory are presented. If the number of shocks to failure and the times between the arrivals of shocks have probability distributions of phase type, then so has the time to failure. PH-distributions are highly versatile and may be used to model many qualitative features of practical interest. They are also well-suited for algorithmic implementation. The computational aspects of our results are discussed in some detail. 相似文献
28.
We study via simulation an M/M/1 queueing system with the assumption that a customer's service time and the interarrival interval separating his arrival from that of his predecessor are correlated random variables having a bivariate exponential distribution. We show that positive correlation reduces the mean and variance of the total waiting time and that negative correlation has the opposite effect. By using spectral analysis and a nonparametric test applied to the sample power spectra associated with certain simulated waiting times we show the effect to be statistically significant. 相似文献
29.
This paper reconsiders the classical model for selling an asset in which offers come in daily and a decision must then be made as to whether or not to sell. For each day the item remains unsold a continuation (or maintenance cost) c is incurred. The successive offers are assumed to be independent and identically distributed random variables having an unknown distribution F. The model is considered both in the case where once an offer is rejected it may not be recalled at a later time and in the case where such recall of previous offers is allowed. 相似文献
30.
In this paper we discuss the properties of a Bilinear Programming problem, and develop a convergent cutting plane algorithm. The cuts involve only a subset of the variables and preserve the special structure of the constraints involving the remaining variables. The cuts are deeper than other similar cuts. 相似文献