全文获取类型
收费全文 | 666篇 |
免费 | 11篇 |
出版年
2021年 | 5篇 |
2019年 | 14篇 |
2018年 | 16篇 |
2017年 | 15篇 |
2016年 | 17篇 |
2015年 | 11篇 |
2013年 | 159篇 |
2011年 | 5篇 |
2010年 | 8篇 |
2009年 | 5篇 |
2007年 | 6篇 |
2006年 | 7篇 |
2005年 | 15篇 |
2004年 | 8篇 |
2003年 | 9篇 |
2002年 | 7篇 |
2000年 | 11篇 |
1999年 | 9篇 |
1998年 | 6篇 |
1997年 | 13篇 |
1996年 | 14篇 |
1995年 | 6篇 |
1994年 | 13篇 |
1993年 | 11篇 |
1992年 | 10篇 |
1991年 | 16篇 |
1990年 | 10篇 |
1989年 | 14篇 |
1988年 | 7篇 |
1987年 | 17篇 |
1986年 | 12篇 |
1985年 | 12篇 |
1984年 | 11篇 |
1983年 | 8篇 |
1982年 | 8篇 |
1981年 | 9篇 |
1980年 | 10篇 |
1979年 | 9篇 |
1978年 | 11篇 |
1977年 | 9篇 |
1976年 | 11篇 |
1975年 | 8篇 |
1974年 | 14篇 |
1973年 | 8篇 |
1972年 | 11篇 |
1971年 | 15篇 |
1970年 | 5篇 |
1969年 | 8篇 |
1968年 | 7篇 |
1967年 | 4篇 |
排序方式: 共有677条查询结果,搜索用时 15 毫秒
31.
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. 相似文献
32.
John P. Matthews 《海军后勤学研究》1977,24(4):679-690
The purpose of this paper and the accompanying tables is to facilitate the calculation of constrained optimum order quantities and reorder points for an inventory control system where the criterion of optimality is the minimization of expected inventory holding, ordering, and time-weighted backorder costs. The tables provided in the paper allow the identification of the optimal solution when order quantities and/or reorder points are restricted to a set of values which do not include the unconstrained optimal solution. 相似文献
33.
The problem of multiple-resource capacity planning under an infinite time horizon is analyzed using a nonlinear programming model. The analysis generalizes to the long term the short-run pricing model for computer networks developed in Kriebel and Mikhail [5]. The environment assumes heterogeneous resource capacities by age (vingate), which service a heterogeneous and relatively captive market of users with known demand functions in each time period. Total variable operating costs are given by a continuous psuedoconcave function of system load, capacity, and resource age. Optimal investment, pricing, and replacement decision rules are derived in the presence of economies of scale and exogenous technological progress. Myopic properties of the decision rules which define natural (finite) planning subhorizons are discussed. 相似文献
34.
Charles A. Holloway 《海军后勤学研究》1977,24(2):377-380
Using the general computational strategy of restriction, necessary conditions for optimality provide an alternative criterion for entering variables when degeneracies arises in linear programming problems. Although cycling may still occur, it is shown that if it is possible to make progress at the next iteration, the criterion is guaranteed to identify a non-basic variable which increases the value of the basic solution, thereby reducing stalling. An alternative method for determining variables to exit the basis when degeneracies occur is also suggested. 相似文献
35.
In this note we analyze the fractional interval programming problem (FIP) and find, explicitly, all its optimal solutions. Though our results are essentially the same as those in Charnes and Cooper [4], the proofs and analysis we provide here are considerably simpler. 相似文献
36.
The ordered matrix flow shop problem with no passing of jobs is considered. In an earlier paper, the authors have considered a special case of the problem and have proposed a simple and efficient algorithm that finds a sequence with minimum makespan for a special problem. This paper considers a more general case. This technique is shown to be considerably more efficient than are existing methods for the conventional flow shop problems. 相似文献
37.
A Linear Fractional Interval Programming problem (FIP) is the problem of extremizing a linear fractional function subject to two-sided linear inequality constraints. In this paper we develop an algorithm for solving (FIP) problems. We first apply the Charnes and Cooper transformation on (FIP) and then, by exploiting the special structure of the pair of (LP) problems derived, the algorithm produces an optimal solution to (FIP) in a finite number of iterations. 相似文献
38.
The problem is to protect a set of t targets by n perfect interceptors against an attack by m perfect weapons. If the defender solves for an optimal preallocated preferential defense and associated game value assuming m1 attackers, and the attacker knows the assumption of the defender and utilizes m2 attackers, he may be able to achieve significantly more damage than had the defender assumed that there would be m2 attackers. The article treats the robustness of preallocated preferential defense to assumptions about the size of the attack and presents results of an alternative approach. 相似文献
39.
40.