全文获取类型
收费全文 | 465篇 |
免费 | 6篇 |
出版年
2020年 | 6篇 |
2019年 | 8篇 |
2018年 | 4篇 |
2017年 | 13篇 |
2016年 | 9篇 |
2015年 | 7篇 |
2014年 | 6篇 |
2013年 | 121篇 |
2011年 | 5篇 |
2010年 | 5篇 |
2009年 | 4篇 |
2008年 | 5篇 |
2007年 | 5篇 |
2006年 | 4篇 |
2005年 | 8篇 |
2004年 | 4篇 |
2003年 | 5篇 |
2002年 | 4篇 |
2001年 | 4篇 |
2000年 | 4篇 |
1999年 | 5篇 |
1996年 | 6篇 |
1995年 | 11篇 |
1994年 | 8篇 |
1993年 | 6篇 |
1992年 | 9篇 |
1991年 | 12篇 |
1989年 | 9篇 |
1988年 | 8篇 |
1987年 | 11篇 |
1986年 | 11篇 |
1985年 | 11篇 |
1984年 | 3篇 |
1983年 | 5篇 |
1982年 | 9篇 |
1980年 | 9篇 |
1979年 | 4篇 |
1978年 | 7篇 |
1977年 | 6篇 |
1976年 | 4篇 |
1975年 | 8篇 |
1974年 | 11篇 |
1973年 | 10篇 |
1972年 | 6篇 |
1971年 | 9篇 |
1970年 | 6篇 |
1969年 | 6篇 |
1968年 | 7篇 |
1967年 | 3篇 |
1948年 | 3篇 |
排序方式: 共有471条查询结果,搜索用时 15 毫秒
91.
In this paper a model is developed for determining optimal strategies for two competing firms which are about to submit sealed tender bids on K contracts. A contract calls for the winning firm to supply a specific amount of a commodity at the bid price. By the same token, the production of that commodity involves various amounts of N different resources which each firm possesses in limited quantities. It is assumed that the same two firms bid on each contract and that each wants to determine a bidding strategy which will maximize its profits subject to the constraint that the firm must be able to produce the amount of products required to meet the contracts it wins. This bidding model is formulated as a sequence of bimatrix games coupled together by N resource constraints. Since the firms' strategy spaces are intertwined, the usual quadratic programming methods cannot be used to determine equilibrium strategies. In lieu of this a number of theorems are given which partially characterize such strategies. For the single resource problem techniques are developed for determining equilibrium strategies. In the multiple resource problem similar methods yield subequilibrium strategies or strategies that are equilibrium from at least one firm's point of view. 相似文献
92.
This paper presents the details for applying and specializing the work of Ellis Johnson [10] and [11] to develop a primal code for the well-known capacitated transportation problem. The code was developed directly from the work of Johnson, but is similar to codes developed by Glover, Karney, Klingman, and Napier [6] and Srinivasan and Thompson [14]. The emphasis in the presentation is the use of the graphical representation of the basis to carry out the revised simplex operations. This is a means of exploiting the special structure and sparseness of the constraint matrix to minimize computational effort and storage requirements. We also present the results of solving several large problems with the code developed. 相似文献
93.
This paper gives bounds on the availability function for an alternating renewal process with exponential failure and general repair times. A bound on the error is also given. Several of the bounds with greatest practical consequence are worked out and illustrated. Repair distributions for which a lower bound on availability is easily computed are gamma (integer shape parameter), log normal, and Weibull. Finally, some simulation results for log normal repair versus gamma repair are given. 相似文献
94.
W. L. Wilkinson 《海军后勤学研究》1973,20(3):505-516
This paper presents an algorithm for determining the upper and lower bounds for arc flows in a maximal dynamic flow solution. The procedure is basically an extended application of the Ford-Fulkerson dynamic flow algorithm which also solves the minimal cost flow problem. A simple example is included. The presence of bounded optimal are flows entertains the notion that one can pick a particular solution which is preferable by secondary criteria. 相似文献
95.
James G. Taylor 《海军后勤学研究》1973,20(4):673-697
We develop the solution to a simple problem of target selection in Lanchester combat against two enemy force types each of which undergoes a “linear-law” attrition process. In addition to the Pontryagin maximum principle, the theory of singular extremals is required to solve this problem. Our major contribution is to show how to synthesize the optimal target selection policies from the basic optimality conditions. This solution synthesis methodology is applicable to more general dynamic (tactical) allocation problems. For constant attrition-rate coefficients we show that whether or not changes can occur in target priorities depends solely on how survivors are valued and is independent of the type of attrition process. 相似文献
96.
In this paper a very versatile game model is developed for use in the long range planning of our strategic force posture. This highly aggregate model yields optimal force mixes for the triad (land- and sea-based missile systems and bombers) under a variety of constraints. The model described here is a survivability model; however, it is shown how the model can still be used as a measure of overall system effectiveness. Constraints imposed on the problem include both SALT and budget limitations. 相似文献
97.
James H. Patterson 《海军后勤学研究》1976,23(1):95-123
Individual characteristics of multiple-constrained resource, project scheduling problems are examined in an attempt to predict the solution obtainable with heuristic methods. Difficulties encountered in performing this type of research are described, and several multiple regression models are developed for predicting heuristic performance. Both single and multiple project data are examined, and results reported demonstrate the efficacy of determining beforehand the method used for problem solution. 相似文献
98.
Manfred W. Padberg 《海军后勤学研究》1972,19(4):699-708
In this paper we show that every bounded integer linear program can be transformed into an integer program involving one single linear constraint and upper and lower bounds on the variables, such that the solution space of the original problem coincides with that one of the equivalent knapsack-type problem. 相似文献
99.
100.
The problem of assigning computer program modules to functionally similar processors in a distributed computer network is investigated. The modules of a program must be assigned among processors in such a way as to minimize interprocessor communication while taking advantage of affinities of certain modules to particular processors. This problem is formulated as a zero-one quadratic programming problem, but is more conveniently modeled as a directed acyclic search graph. The model is developed and a backward shortest path labeling algorithm is given that produces an assignment of program modules to processors. A non-backtracking branch-and-bound algorithm is described that uses a local neighborhood search at each stage of the search graph. 相似文献