全文获取类型
收费全文 | 637篇 |
免费 | 18篇 |
出版年
2019年 | 17篇 |
2018年 | 12篇 |
2017年 | 20篇 |
2016年 | 13篇 |
2015年 | 17篇 |
2014年 | 20篇 |
2013年 | 136篇 |
2012年 | 7篇 |
2011年 | 6篇 |
2010年 | 9篇 |
2009年 | 14篇 |
2007年 | 6篇 |
2006年 | 8篇 |
2005年 | 9篇 |
2004年 | 13篇 |
2003年 | 10篇 |
2002年 | 11篇 |
2001年 | 6篇 |
2000年 | 11篇 |
1999年 | 7篇 |
1998年 | 13篇 |
1997年 | 7篇 |
1996年 | 9篇 |
1995年 | 6篇 |
1994年 | 17篇 |
1993年 | 7篇 |
1992年 | 4篇 |
1991年 | 7篇 |
1990年 | 8篇 |
1988年 | 6篇 |
1987年 | 5篇 |
1986年 | 20篇 |
1985年 | 14篇 |
1984年 | 9篇 |
1983年 | 8篇 |
1982年 | 7篇 |
1981年 | 8篇 |
1980年 | 7篇 |
1979年 | 11篇 |
1978年 | 13篇 |
1976年 | 9篇 |
1975年 | 8篇 |
1974年 | 13篇 |
1973年 | 9篇 |
1972年 | 10篇 |
1971年 | 7篇 |
1970年 | 12篇 |
1969年 | 10篇 |
1968年 | 7篇 |
1967年 | 6篇 |
排序方式: 共有655条查询结果,搜索用时 93 毫秒
121.
The problem of finding minimal disconnecting sets for multi-commodity directed networks may be solved using an arc-path formulation and Gomory's all-integer integer programming algorithm. However, the number of network constraints may be astronomical for even moderately sized networks. This paper develops a finite algorithm similar to Gomory's, but requiring no more than m rows in the tableau, where m is the number of arcs in the network. 相似文献
122.
The problem of determining multicommodity flows over a capacitated network subject to resource constraints may be solved by linear programming; however, the number of potential vectors in most applications is such that the standard arc-chain formulation becomes impractical. This paper describes an approach—an extension of the column generation technique used in the multicommodity network flow problem—that simultaneously considers network chain selection and resource allocation, thus making the problem both manageable and optimal. The flow attained is constrained by resource availability and network capacity. A minimum-cost formulation is described and an extension to permit the substitution of resources is developed. Computational experience with the model is discussed. 相似文献
123.
J. P. Evans 《海军后勤学研究》1970,17(3):281-286
In this paper we examine the relationship between two constraint qualifications developed by Abadie and Arrow, Hurwicz, and Uzawa. A third constraint qualification is discussed and shown to be weaker than either of those mentioned above. 相似文献
124.
125.
126.
127.
This paper describes the background of the Office of Management Budget Circular A-21, “Principles for Determining Costs Applicable to Grants, Contracts, and Other Agreements with Educational Institutions,” that describes the requirement for effort reporting. A sampling procedure is proposed as an alternative to 100% reporting. 相似文献
128.
Philip J. Boland 《海军后勤学研究》1982,29(4):541-546
A policy of periodic replacement with minimal repair at failure is considered for a complex system. Under such a policy the system is replaced at multiples of some period T while minimal repair is performed at any intervening system failures. The cost of a minimal repair to the system is assumed to be a nonde-creasing function of its age. A simple expression is derived for the expected minimal repair cost in an interval in terms of the cost function and the failure rate of the system. Necessary and sufficient conditions for the existence of an optimal replacement interval are exhibited in the case where the system life distribution is strictly increasing failure rate (IFR). 相似文献
129.
This work is concerned with a particular class of bimatrix games, the set of equilibrium points of which games possess many of the properties of solutions to zero-sum games, including susceptibility to solution by linear programming. Results in a more general setting are also included. Some of the results are believed to constitute interesting potential additions to elementary courses in game theory. 相似文献
130.
The reliability of a serial production line is optimized with respect to the location of a single buffer. The problem was earlier defined and solved by Soyster and Toof for the special case of an even number of machines all having equal probability of failure. In this paper we generalize the results for any number of machines and remove the restriction of identical machine reliabilities. In addition, an analysis of multibuffer systems is presented with a closed form solution for the reliability when both the number of buffers and their capacity is limited. For the general multibuffer system we present an approach for determining system reliability. 相似文献