全文获取类型
收费全文 | 443篇 |
免费 | 5篇 |
出版年
2020年 | 5篇 |
2019年 | 6篇 |
2018年 | 11篇 |
2017年 | 13篇 |
2016年 | 14篇 |
2015年 | 5篇 |
2014年 | 6篇 |
2013年 | 146篇 |
2011年 | 4篇 |
2010年 | 5篇 |
2009年 | 4篇 |
2005年 | 9篇 |
2004年 | 3篇 |
2003年 | 6篇 |
2002年 | 7篇 |
2001年 | 3篇 |
2000年 | 4篇 |
1999年 | 5篇 |
1998年 | 4篇 |
1997年 | 6篇 |
1996年 | 4篇 |
1995年 | 8篇 |
1994年 | 7篇 |
1993年 | 8篇 |
1992年 | 10篇 |
1991年 | 12篇 |
1990年 | 3篇 |
1989年 | 7篇 |
1988年 | 3篇 |
1987年 | 12篇 |
1986年 | 7篇 |
1985年 | 7篇 |
1984年 | 4篇 |
1983年 | 3篇 |
1982年 | 3篇 |
1981年 | 3篇 |
1980年 | 5篇 |
1979年 | 3篇 |
1978年 | 10篇 |
1977年 | 3篇 |
1976年 | 5篇 |
1975年 | 5篇 |
1974年 | 9篇 |
1973年 | 4篇 |
1972年 | 4篇 |
1971年 | 4篇 |
1970年 | 5篇 |
1969年 | 4篇 |
1968年 | 4篇 |
1967年 | 3篇 |
排序方式: 共有448条查询结果,搜索用时 46 毫秒
311.
A cutting plane method, based on a geometric inequality, is described as a means of solving geometric programs. While the method is applied to the primal geometric program, it is shown to retain the geometric programming duality relationships. Several methods of generating the cutting planes are discussed and illustrated on some example problems. 相似文献
312.
The 0-1 multiple-knapsack problem is an extension of the well-known 0-1 knapsack problem. It is a problem of assigning m objects, each having a value and a weight, to n knapsacks in such a way that the total weight in each knapsack is less than its capacity limit and the total value in the knapsacks is maximized. A branch-and-bound algorithm for solving the problem is developed and tested. Branching rules that avoid the search of redundant partial solutions are used in the algorithm. Various bounding techniques, including Lagrangean and surrogate relaxations, are investigated and compared. 相似文献
313.
It is often assumed in the facility location literature that functions of the type øi(xi, y) = βi[(xi-x)2+(yi-y)2]K/2 are twice differentiable. Here we point out that this is true only for certain values of K. Convexity proofs that are independent of the value of K are given. 相似文献
314.
John P. Bonin 《海军后勤学研究》1978,25(2):357-364
In a static environment, J. Hirschleifer's marginal cost solution to the transfer pricing problem is commonly accepted as analytically correct. However, actual pricing practice within Western corporations and socialist-planned economies generally deviates from marginal cost pricing. Some form of average cost pricing is more commonly chosen. Recently in this journal, H. Enzer has claimed to show that some form of average cost pricing is indeed the analytically correct solution to the transfer pricing problem when choice of technique and manipulation are allowed. Enzer claims that optimal decisions made by each of two divisions according to their individual self-interests are made compatible with overall firm optimization when the transfer price assigned to the internally-transferred commodity is any form of average cost. We show that the marginal cost solution is correct for Enzer's problem in the absence of manipulation by either division. Indeed, this was all that Hirschleifer claimed. In the process, we uncover a fundamental mathematical error in Enzer's argument. When manipulation of the transfer price by divisions is allowed, we demonstrate the faults with Enzer's average cost solution and conclude Hirschleifer's original statements on manipulation to be correct even in Enzer's environment. A final section briefly indicates the importance to the transfer pricing problem of a growing body of economic literature on incentive structures. 相似文献
315.
John S. Croucher 《海军后勤学研究》1975,22(1):197-203
This paper considers a two sided resource allocation game in which both players initially have fixed resources which may be distributed over various targets. Their effectiveness depends on the manner of distribution and also on the strategy of the opponent, a natural payoff function for such a situation being used. The complete solution to the game is derived and a numerical example given. 相似文献
316.
James G. Morris 《海军后勤学研究》1975,22(1):155-164
The Weber Problem generalized to the location of several new points with respect to existing points is formulated as a linear programming problem under the assumption that distances are rectangular. The dual problem is then formulated and subsequently reduced to a problem with substantially fewer variables and constraints than required by an existent alternative linear programming formulation. Flows may exist between new as well as between new and existing points. Linear constraints can be imposed to restrict the location of new points. Pairwise constraints limiting distances between new points and between new and existing points can also be accommodated. 相似文献
317.
James G. Taylor 《海军后勤学研究》1983,30(1):113-131
This article considers combat between two homogeneous forces modeled by variable- coefficient Lanchester-type equations of modern warfare and develops new “simple-approximate” battle-outcome-prediction conditions for military engagements terminated by two different types of prescribed conditions being met (fixed-force-level-breakpoint battles and fixed-force-ratio-breakpoint battles). These battle-outcome-prediction conditions are sufficient (but not necessary) to determine the outcome of battle without having to explicitly compute the force-level trajectories, and they are characterized by their simplicity, requiring no advanced mathematical knowledge or tabulations of “special functions” for their application. Integrability properties of the Lanchester attrition-rate coefficients figure prominently in their results, and involved in their development is a generalization of Lanchester's famous square law to variable-coefficient Lanchester-type combat and several other novel mathematical developments for the analysis of ordinary differential equations. Examples are given, with the attack of a mobile force against a static defensive position (both sides armed with weapons whose firepower is range dependent) being examined in detail. 相似文献
318.
Henrich John Malik 《海军后勤学研究》1970,17(3):327-330
In this paper the exact distribution of the product of two noncentral beta variates is derived using Mellin integral transform. The density function of the product is represented as a mixture of Beta distributions and the distribution function as a mixture of Incomplete Beta Functions. 相似文献
319.
This paper represents a continuation of three previous papers [1-.3] in the study of competitive bidding processes. It treats the case where a bidder's knowledge of his competitor's cost i s given by a probability distribution over a certain interval. The results obtained extend the work of Vickrey [4] to the case where the cost intervals a r e not necessarily symmetric. 相似文献
320.