全文获取类型
收费全文 | 1062篇 |
免费 | 22篇 |
出版年
2021年 | 12篇 |
2019年 | 27篇 |
2018年 | 14篇 |
2017年 | 32篇 |
2016年 | 23篇 |
2015年 | 27篇 |
2014年 | 29篇 |
2013年 | 227篇 |
2010年 | 10篇 |
2009年 | 12篇 |
2008年 | 10篇 |
2007年 | 11篇 |
2006年 | 11篇 |
2005年 | 13篇 |
2004年 | 12篇 |
2002年 | 15篇 |
2001年 | 12篇 |
2000年 | 10篇 |
1999年 | 12篇 |
1998年 | 22篇 |
1997年 | 18篇 |
1996年 | 17篇 |
1995年 | 13篇 |
1994年 | 25篇 |
1993年 | 22篇 |
1992年 | 17篇 |
1991年 | 24篇 |
1990年 | 12篇 |
1989年 | 20篇 |
1988年 | 30篇 |
1987年 | 22篇 |
1986年 | 35篇 |
1985年 | 22篇 |
1984年 | 16篇 |
1983年 | 12篇 |
1982年 | 13篇 |
1981年 | 16篇 |
1980年 | 12篇 |
1979年 | 17篇 |
1978年 | 17篇 |
1977年 | 9篇 |
1976年 | 9篇 |
1975年 | 15篇 |
1974年 | 14篇 |
1973年 | 12篇 |
1972年 | 15篇 |
1971年 | 9篇 |
1970年 | 13篇 |
1969年 | 12篇 |
1967年 | 8篇 |
排序方式: 共有1084条查询结果,搜索用时 31 毫秒
201.
A mixed optimization technique for optimal machine replacement is presented which allows much more flexibility than previous models. Optimal purchase, maintenance and sale of a given machine between any two given points in time is treated as a subproblem, which one may choose to solve via control theory, dynamic programming, or practical engineering considerations. (A control theory formulation is used in the paper as an illustration.) These subproblem solutions are then incorporated into a Wagner-Whitin formulation for solution of the full problem. The technique is particularly useful for problems with such asymmetries as an existing initial machine or uneven technological change. A simple numerical example is solved in the Appendix. 相似文献
202.
203.
A set of edges D called an isolation set, is said to isolate a set of nodes R from an undirected network if every chain between the nodes in R contains at least one edge from the set D. Associated with each edge of the network is a positive cost. The isolation problem is concerned with finding an isolation set such that the sum of its edge costs is a minimum. This paper formulates the problem of determining the minimal cost isolation as a 0–1 integer linear programming problem. An algorithm is presented which applies a branch and bound enumerative scheme to a decomposed linear program whose dual subproblems are minimal cost network flow problems. Computational results are given. The problem is also formulated as a special quadratic assignment problem and an algorithm is presented that finds a local optimal solution. This local solution is used for an initial bound. 相似文献
204.
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. 相似文献
205.
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. 相似文献
206.
207.
208.
209.
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. 相似文献
210.
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). 相似文献