全文获取类型
收费全文 | 564篇 |
免费 | 13篇 |
出版年
2021年 | 6篇 |
2019年 | 13篇 |
2018年 | 9篇 |
2017年 | 11篇 |
2016年 | 9篇 |
2015年 | 9篇 |
2014年 | 5篇 |
2013年 | 104篇 |
2010年 | 5篇 |
2009年 | 9篇 |
2008年 | 10篇 |
2006年 | 5篇 |
2005年 | 8篇 |
2004年 | 12篇 |
2003年 | 8篇 |
2002年 | 5篇 |
2001年 | 5篇 |
2000年 | 7篇 |
1998年 | 7篇 |
1997年 | 6篇 |
1996年 | 17篇 |
1995年 | 7篇 |
1994年 | 9篇 |
1993年 | 7篇 |
1992年 | 10篇 |
1991年 | 18篇 |
1990年 | 6篇 |
1989年 | 12篇 |
1988年 | 11篇 |
1987年 | 14篇 |
1986年 | 16篇 |
1985年 | 18篇 |
1984年 | 9篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1981年 | 6篇 |
1980年 | 12篇 |
1979年 | 6篇 |
1978年 | 9篇 |
1977年 | 8篇 |
1976年 | 9篇 |
1975年 | 7篇 |
1974年 | 8篇 |
1972年 | 11篇 |
1971年 | 12篇 |
1970年 | 11篇 |
1969年 | 8篇 |
1968年 | 9篇 |
1967年 | 9篇 |
1966年 | 9篇 |
排序方式: 共有577条查询结果,搜索用时 15 毫秒
51.
52.
53.
The use of life-cycle costs in procurement is limited by the accuracy of cost estimates and assessments of availability risks under the conditions generating costs. Critical to these problems are the needs and responses of equipment to maintenance and repair. Using transition probabilities to define the relationships between serviceability and maintenance and repairs, this article develops a comprehensive decision support system for military procurement. It uses a dynamic programming model to determine the least-cost set of maintenance and repair decisions, where adjustments are included for warranty conditions, time value of money, the opportunity costs of equipment failure, and the end-of-cycle salvage values or disposal costs. The system allows users to define working and failed states, create their own rules or indicators of availability from estimates of state probabilities and establish thresholds of risk acceptability. 相似文献
54.
55.
This article is concerned with the scaling variant of Karmarkar's algorithm for linear programming problems. Several researchers have presented convergence analyses for this algorithm under various nondegeneracy types of assumptions, or under assumptions regarding the nature of the sequence of iterates generated by the algorithm. By employing a slight perturbation of the algorithm, which is computationally imperceptible, we are able to prove without using any special assumptions that the algorithm converges finitely to an ε-optimal solution for any chosen ε > 0, from which it can be (polynomically) rounded to an optimum, for ε > 0 small enough. The logarithmic barrier function is used as a construct for this analysis. A rounding scheme which produces an optimal extreme point solution is also suggested. Besides the non-negatively constrained case, we also present a convergence analysis for the case of bounded variables. An application in statistics to the L1 estimation problem and related computational results are presented. 相似文献
56.
The flow-shop scheduling problem with sequence-dependent additive setup times is considered as a special case of the general problem, and a polynomially bounded approximate method is developed to find a minimum makespan permutation schedule. The approximate algorithm is shown to yield optimal results for the two-machine case. A version of Sule's model is defined that produces the first approximation of the optimal solution for this problem. Computational experience along with numerical examples are provided to test the effectiveness of the method. 相似文献
57.
Marvin D. Troutt 《海军后勤学研究》1987,34(4):593-603
Multivariable elimination algorithms, which may be regarded as generalizations of various one-dimensional search procedures, have not found wide application. A probable reason may be the generally very irregularly shaped regions of uncertainty that evolve iteratively in the procedures. Hence hope for practical salvage of this class of algorithms seems to lie in controlling the shape of the successively smaller regions of uncertainty. In this article an extension of Bolzano search to rectangles which preserves rectangular iterates is given. Since the result is essentially geometrical in nature, a geometric proof of this procedure is given. Hopefully the proof procedure will be of independent interest. A numerical illustration of the procedure is given for a game problem, such problems lending themselves to this method. 相似文献
58.
59.
Variations of Hale's channel assignment problem, the L(j, k)‐labeling problem and the radio labeling problem require the assignment of integers to the vertices of a graph G subject to various distance constraints. The λj,k‐number of G and the radio number of G are respectively the minimum span among all L(j, k)‐labelings, and the minimum span plus 1 of all radio labelings of G (defined in the Introduction). In this paper, we establish the λj,k‐number of ∏ K for pairwise relatively prime integers t1 < t2 < … < tq, t1 ≥ 2. We also show the existence of an infinite class of graphs G with radio number |V(G)| for any diameter d(G). © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
60.