全文获取类型
收费全文 | 502篇 |
免费 | 28篇 |
国内免费 | 5篇 |
出版年
2022年 | 3篇 |
2021年 | 6篇 |
2020年 | 7篇 |
2019年 | 4篇 |
2017年 | 10篇 |
2016年 | 12篇 |
2015年 | 17篇 |
2014年 | 11篇 |
2013年 | 67篇 |
2012年 | 33篇 |
2011年 | 31篇 |
2010年 | 28篇 |
2009年 | 22篇 |
2008年 | 34篇 |
2007年 | 23篇 |
2006年 | 18篇 |
2005年 | 14篇 |
2004年 | 5篇 |
2003年 | 5篇 |
2002年 | 5篇 |
2001年 | 4篇 |
1999年 | 5篇 |
1998年 | 6篇 |
1997年 | 7篇 |
1995年 | 5篇 |
1994年 | 4篇 |
1993年 | 5篇 |
1992年 | 2篇 |
1991年 | 4篇 |
1989年 | 7篇 |
1987年 | 2篇 |
1986年 | 10篇 |
1985年 | 7篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1981年 | 8篇 |
1980年 | 9篇 |
1979年 | 11篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 8篇 |
1975年 | 8篇 |
1974年 | 2篇 |
1973年 | 2篇 |
1972年 | 12篇 |
1971年 | 3篇 |
1970年 | 3篇 |
1969年 | 9篇 |
1968年 | 7篇 |
1966年 | 3篇 |
排序方式: 共有535条查询结果,搜索用时 15 毫秒
11.
Capacity expansion models typically minimize the discounted cost of acquisition and operation over a given planning horizon. In this article we generalize this idea to one in which a capital supply curve replaces the usual discount rate. A capital supply curve is a means to model financial outlook, investment limits, and risk. We show that when such a curve is included in a capacity expansion model, it will, under certain conditions, provide a less capital intensive solution than one which incorporates a discount rate. In this article, we also provide an algorithm that solves capacity expansion models that incorporate a capital supply curve. The attractive feature of this algorithm is that it provides a means to utilize the “discount rate” models efficiently. Throughout, we give applications in power generation planning and computational experience for this application is also presented. 相似文献
12.
13.
This paper considers a logistics system modelled as a transportation problem with a linear cost structure and lower bounds on supply from each origin and to each destination. We provide an algorithm for obtaining the growth path of such a system, i. e., determining the optimum shipment patterns and supply levels from origins and to destinations, when the total volume handled in the system is increased. Extensions of the procedure for the case when the costs of supplying are convex and piecewise linear and for solving transportation problems that are not in “standard form” are discussed. A procedure is provided for determining optimal plant capacities when the market requirements have prespecified growth rates. A goal programming growth model where the minimum requirements are treated as goals rather than as absolute requirements is also formulated. 相似文献
14.
The authors extend the generalized von Neumann model they developed (with J. G. Kemeny) in 1956 to an open model by assuming that there are exogeneously determined export and import prices and that any amount can be exported or imported at these prices. The open model is then characterized by means of seven axioms. It is shown, by applying the theory of linear programming, that if four economically reasonable assumptions hold, the open model has at least one solution in which at least one good with positive export price is exported and at least one good with positive import price is imported. It is also shown that, in general, a continuum of expansion rates can be achieved by varying certain control variables. The choice of these expansion rates gives indirectly the choice of a suitable sub-economy and also determines the exports and imports of the economy. Other results and examples are discussed. 相似文献
15.
Peter L. Hammer 《海军后勤学研究》1969,16(3):345-357
A method is given for finding those solutions of a transportation problem which minimize the total time necessary for transporting goods from the suppliers to the consumers. Several extensions of the model are presented. 相似文献
16.
17.
This paper presents a general solution for the M/M/r queue with instantaneous jockeying and r > 1 servers. The solution is obtained in matrices in closed form without recourse to the generating function arguments usually used. The solution requires the inversion of two (Zr?1) × (2r?1) matrices. The method proposed is extended to allow different queue selection preferences of arriving customers, balking of arrivals, jockeying preference rules, and queue dependent selection along with jockeying. To illustrate the results, a problem previously published is studied to show how known results are obtained from the proposed general solution. 相似文献
18.
19.
20.