全文获取类型
收费全文 | 582篇 |
免费 | 9篇 |
出版年
2021年 | 10篇 |
2019年 | 10篇 |
2018年 | 5篇 |
2017年 | 7篇 |
2016年 | 9篇 |
2015年 | 6篇 |
2014年 | 6篇 |
2013年 | 111篇 |
2009年 | 5篇 |
2008年 | 4篇 |
2007年 | 14篇 |
2005年 | 6篇 |
2004年 | 5篇 |
2003年 | 10篇 |
2002年 | 8篇 |
2000年 | 5篇 |
1999年 | 6篇 |
1998年 | 7篇 |
1997年 | 8篇 |
1996年 | 12篇 |
1995年 | 7篇 |
1994年 | 11篇 |
1993年 | 13篇 |
1992年 | 8篇 |
1991年 | 12篇 |
1990年 | 11篇 |
1989年 | 21篇 |
1988年 | 20篇 |
1987年 | 12篇 |
1986年 | 19篇 |
1985年 | 10篇 |
1984年 | 5篇 |
1983年 | 6篇 |
1982年 | 17篇 |
1981年 | 7篇 |
1980年 | 11篇 |
1979年 | 12篇 |
1978年 | 10篇 |
1977年 | 9篇 |
1976年 | 6篇 |
1975年 | 8篇 |
1974年 | 13篇 |
1973年 | 10篇 |
1972年 | 7篇 |
1971年 | 14篇 |
1970年 | 8篇 |
1969年 | 10篇 |
1968年 | 6篇 |
1967年 | 8篇 |
1948年 | 4篇 |
排序方式: 共有591条查询结果,搜索用时 15 毫秒
121.
122.
123.
124.
During the course of the last few years, attacks on the traveling salesman problem have resulted in a variety of often innovative and rather powerful computational procedures. In this article, we present a review of these results for problems defined on weighted and unweighted graphs. Some account of computational behavior for exact algorithms is provided; however, the primary coverage deals with the strategy of particular procedures. In addition, we include some aspects of nonexact algorithms with major interest confined to the establishment of worst-case bounds. 相似文献
125.
In this paper a model is developed for determining optimal strategies for two competing firms which are about to submit sealed tender bids on K contracts. A contract calls for the winning firm to supply a specific amount of a commodity at the bid price. By the same token, the production of that commodity involves various amounts of N different resources which each firm possesses in limited quantities. It is assumed that the same two firms bid on each contract and that each wants to determine a bidding strategy which will maximize its profits subject to the constraint that the firm must be able to produce the amount of products required to meet the contracts it wins. This bidding model is formulated as a sequence of bimatrix games coupled together by N resource constraints. Since the firms' strategy spaces are intertwined, the usual quadratic programming methods cannot be used to determine equilibrium strategies. In lieu of this a number of theorems are given which partially characterize such strategies. For the single resource problem techniques are developed for determining equilibrium strategies. In the multiple resource problem similar methods yield subequilibrium strategies or strategies that are equilibrium from at least one firm's point of view. 相似文献
126.
Two types of warranties are analyzed. These are the free-replacement warranty, under which failed items are replaced free of charge until a specified total operating time has been achieved, and the pro rata warranty, under which items that fail prior to a specified time are replaced at pro rata cost to the buyer. Both the buyer's and seller's points of view are considered. The basis of the analysis is a comparison of warranted and unwarranted (otherwise identical) items with regard to long-run cost to the buyer and long-run profit to the seller. Application of the results requires knowledge of certain characteristics of the life distribution of the items in question. Parametric and nonparametric methods of estimation of these characteristics from incomplete data are discussed. Single and multiple failure-mode situations are considered. Some solutions to the problem are illustrated using incomplete data on failure times of an aircraft component. 相似文献
127.
This paper presents the details for applying and specializing the work of Ellis Johnson [10] and [11] to develop a primal code for the well-known capacitated transportation problem. The code was developed directly from the work of Johnson, but is similar to codes developed by Glover, Karney, Klingman, and Napier [6] and Srinivasan and Thompson [14]. The emphasis in the presentation is the use of the graphical representation of the basis to carry out the revised simplex operations. This is a means of exploiting the special structure and sparseness of the constraint matrix to minimize computational effort and storage requirements. We also present the results of solving several large problems with the code developed. 相似文献
128.
Alan R. Washburn 《海军后勤学研究》1974,21(4):705-713
This paper includes two simple analytic formulas for kill probability that are applicable in circumstances where shots should be fired in a pattern. The two formulas bracket the maximum kill probability achievable with an optimal pattern. The upper bound corresponds to an optimal nonfeasible pattern, and the lower bound to a nonoptimal feasible pattern. 相似文献
129.
Robert R. Trippi 《海军后勤学研究》1974,21(2):327-332
A framework is developed for analyzing the likelihood of acceptance of an investment project proposal when objectives are uncertain. The foundation is a utility model of top management's choice process, modified if need be through a Bayesian approach which takes into account any apparent inconsistency in the history of past proposal acceptances and rejections. 相似文献
130.
This paper gives bounds on the availability function for an alternating renewal process with exponential failure and general repair times. A bound on the error is also given. Several of the bounds with greatest practical consequence are worked out and illustrated. Repair distributions for which a lower bound on availability is easily computed are gamma (integer shape parameter), log normal, and Weibull. Finally, some simulation results for log normal repair versus gamma repair are given. 相似文献