全文获取类型
收费全文 | 215篇 |
免费 | 8篇 |
出版年
2021年 | 4篇 |
2020年 | 2篇 |
2019年 | 6篇 |
2018年 | 5篇 |
2017年 | 5篇 |
2016年 | 4篇 |
2014年 | 5篇 |
2013年 | 30篇 |
2011年 | 2篇 |
2010年 | 3篇 |
2009年 | 4篇 |
2008年 | 3篇 |
2006年 | 3篇 |
2005年 | 3篇 |
2004年 | 3篇 |
2003年 | 2篇 |
2002年 | 6篇 |
2001年 | 4篇 |
2000年 | 3篇 |
1999年 | 2篇 |
1998年 | 2篇 |
1997年 | 5篇 |
1996年 | 2篇 |
1995年 | 2篇 |
1994年 | 3篇 |
1993年 | 8篇 |
1992年 | 3篇 |
1991年 | 4篇 |
1989年 | 3篇 |
1988年 | 10篇 |
1987年 | 3篇 |
1986年 | 6篇 |
1985年 | 9篇 |
1984年 | 8篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1980年 | 5篇 |
1979年 | 4篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 2篇 |
1974年 | 6篇 |
1973年 | 1篇 |
1972年 | 2篇 |
1971年 | 7篇 |
1970年 | 3篇 |
1969年 | 4篇 |
1968年 | 1篇 |
1967年 | 2篇 |
1966年 | 1篇 |
排序方式: 共有223条查询结果,搜索用时 31 毫秒
51.
This paper analyzes the problem faced by a field commander who, confronted by an enemy on N battlefields, must determine an interdiction policy for the enemy's logistics system which minimizes the amount of war material flowing through this system per unit time. The resource utilized to achieve this interdiction is subject to constraint. It can be shown that this problem is equivalent to determining the set of arcs Z* to remove subject to constraint from a directed graph G such that the resulting maximal flow is minimized. A branch and bound algorithm for the solution to this problem is described, and a numerical example is provided. 相似文献
52.
Generalized Lagrange Multipliers (GLM) are used to develop an algorithm for a type of multiproduct single period production planning problem which involves discontinuities of the fixed charge variety. Several properties of the GLM technique are developed for this class of problems and from these properties an algorithm is obtained. The problem of resolving the gaps which are exposed by the GLM procedure is considered, and an example involving a quadratic cost function is explored in detail. 相似文献
53.
A. P. Basu 《海军后勤学研究》1971,18(3):329-337
Let us assume that observations are obtained at random and sequentially from a population with density function In this paper we consider a sequential rule for estimating μ when σ is unknown corresponding to the following class of cost functions In this paper we consider a sequential rule for estimating μ when σ is unknown corresponding to the following class of cost functions Where δ(XI,…,XN) is a suitable estimator of μ based on the random sample (X1,…, XN), N is a stopping variable, and A and p are given constants. To study the performance of the rule it is compared with corresponding “optimum fixed sample procedures” with known σ by comparing expected sample sizes and expected costs. It is shown that the rule is “asymptotically efficient” when absolute loss (p=-1) is used whereas the one based on squared error (p = 2) is not. A table is provided to show that in small samples similar conclusions are also true. 相似文献
54.
In this paper applications of results obtained by these authors for a generalized version of a problem proposed by Smirnov, are considered. The areas of application explored are system interface, queueing, transportation flow, and sequential analysis. The included table should be invaluable to the reader in applying these results. Finally the relationship between the limiting and exact expressions relating to this table is also explored. 相似文献
55.
This paper discusses a mixed integer programming method for solving the Facilities Location Problem with capacities on the facilities. The algorithm uses a Decomposition technique to solve the dual of the associated continuous problem in each branch-bound iteration. The method was designed to produce the global optimum solution for problems with up to 100 facilities and 1,000 customers. Computational experience and a complete example are also presented in the appendix. 相似文献
56.
57.
Kanet addressed the problem of scheduling n jobs on one machine so as to minimize the sum of absolute lateness under a restrictive assumption on their common due date. This article extends the results to the problem of scheduling n jobs on m parallel identical processors in order to minimize the sum of absolute lateness. Also, a heuristic algorithm for a more general version with no restriction on the common due date, for the problem of n-job single-machine scheduling is presented and its performance is reported. 相似文献
58.
This article treats the problem of determining optimal and approximately optimal order quantities for a multiple-item inventory system subject to a single constraint on space or budget. Although this problem can be solved by the usual method of Lagrange multipliers, we wish to consider a more efficient scheme that requires fewer computations. We provide calculations that compare and contrast four approximation techniques. In particular, we have discovered a method that yields a direct algebraic expression of the problem parameters for allocation and achieves an expected profit within 90% of the optimal in about 90% of the cases tested. 相似文献
59.
The subject of this note is the validity of the algorithm described by Aneja and Nair to solve the constrained shortest-path problem. 相似文献
60.
P. C. Joshi 《海军后勤学研究》1979,26(4):675-679
A recurrence relation between the moments of order statistics from the gamma distribution having an integer parameter r is obtained. It is shown that if the negative moments of orders -(r?1), …, ?1 of the smallest order statistic in random samples of size n are known, then one can obtain all the moments. Tables of negative moments for r = 2 (1) 5 are also given. 相似文献