全文获取类型
收费全文 | 556篇 |
免费 | 12篇 |
出版年
2021年 | 14篇 |
2019年 | 11篇 |
2018年 | 8篇 |
2017年 | 6篇 |
2016年 | 10篇 |
2014年 | 10篇 |
2013年 | 84篇 |
2012年 | 5篇 |
2009年 | 11篇 |
2007年 | 16篇 |
2005年 | 4篇 |
2004年 | 7篇 |
2003年 | 10篇 |
2002年 | 13篇 |
2001年 | 7篇 |
2000年 | 7篇 |
1999年 | 5篇 |
1998年 | 10篇 |
1997年 | 11篇 |
1996年 | 10篇 |
1995年 | 9篇 |
1994年 | 8篇 |
1993年 | 13篇 |
1992年 | 10篇 |
1991年 | 14篇 |
1990年 | 14篇 |
1989年 | 21篇 |
1988年 | 17篇 |
1987年 | 14篇 |
1986年 | 17篇 |
1985年 | 7篇 |
1984年 | 8篇 |
1983年 | 6篇 |
1982年 | 11篇 |
1981年 | 10篇 |
1980年 | 10篇 |
1979年 | 11篇 |
1978年 | 11篇 |
1977年 | 10篇 |
1976年 | 7篇 |
1975年 | 7篇 |
1974年 | 10篇 |
1973年 | 9篇 |
1972年 | 4篇 |
1971年 | 8篇 |
1970年 | 8篇 |
1969年 | 8篇 |
1968年 | 3篇 |
1967年 | 6篇 |
1948年 | 4篇 |
排序方式: 共有568条查询结果,搜索用时 15 毫秒
381.
R. R. Meyer 《海军后勤学研究》1981,28(1):115-131
This paper provides a theoretical and computational comparison of alternative mixed integer programming formulations for optimization problems involving certain types of economy-of-scale functions. Such functions arise in a broad range of applications from such diverse areas as vendor selection and communications network design. A “nonstandard” problem formulation is shown to be superior in several respects to the traditional formulation of problems in this class. 相似文献
382.
This paper studies the one-period, general network distribution problem with linear costs. The approach is to decompose the problem into a transportation problem that represents a stocking decision, and into decoupled newsboy problems that represent the realization of demand with the usual associated holding and shortage costs. This approach leads to a characterization of optimal policies in terms of the dual of the transportation problem. This method is not directly suitable for the solution for large problems, but the exact solution for small problems can be obtained. For the numerical solutions of large problems, the problem has been formulated as a linear program with column generation. This latter approach is quite robust in the sense that it is easily extended to incorporate capacity constraints and the multiproduct case. 相似文献
383.
James K. Hartman 《海军后勤学研究》1973,20(3):569-576
When applied to a problem which has more than one local optimal solution, most nonlinear programming algorithms will terminate with the first local solution found. Several methods have been suggested for extending the search to find the global optimum of such a nonlinear program. In this report we present the results of some numerical experiments designed to compare the performance of various strategies for finding the global solution. 相似文献
384.
385.
386.
387.
Charles H. Reilly Clark A. Mount-Campbell Fernando Mata Eric K. Walton Eric A. Aebker Curt A. Levis 《海军后勤学研究》1991,38(6):779-797
We consider the problem of allotting locations in the geostationary orbit to communication satellites, subject to angle of elevation and electromagnetic interference constraints. An optimization framework is used as a means of finding feasible allotment plans. Specifically, we present a two-phase solution procedure for the satellite location problem (SLP). The objective in SLP is to allot geostationary orbital locations to satellites so as to minimize the sum of the absolute differences between the locations prescribed for the satellites and corresponding specified desired locations. We describe two heuristics, an ordering procedure and a k-permutation algorithm, that are used in tandem to find solutions to SLP. Solutions to a worldwide example problem with 183 satellites serving 208 service areas are summarized. 相似文献
388.
Hemiter's entropy model for brand purchase behavior has been generalized for Renyi's measure of entropy which is a more general concept than Shannon's measure of entropy used by Herniter and which includes Shannon's measure as a limiting case. The generalized model considered here is more flexible than Herniter's model since it can give different marketing statistics for different products and it can give these statistics even when only some of the brands are considered. 相似文献
389.
This paper analyses the E/M/c queueing system and shows how to calculate the expected number in the system, both at a random epoch and immediately preceding an arrival. These expectations are expressed in terms of certain initial probabilities which are determined by linear equations. The advantages and disadvantages of this method are also discussed. 相似文献
390.
The shortest path problem between two specified nodes in a general network possesses the unimodularity property and, therefore, can be solved by efficient labelling algorithms. However, the introduction of an additional linear constraint would, in general, destroy this property and the existing algorithms are not applicable in this case. This paper presents a parametric approach for solving this problem. The algorithm presented would require, on the average, a number of iterations which is polynomially bounded. The similarity of this approach to that of the generalized Lagrange multiplier technique is demonstrated and a numerical example is presented. 相似文献