全文获取类型
收费全文 | 720篇 |
免费 | 22篇 |
国内免费 | 1篇 |
专业分类
743篇 |
出版年
2021年 | 11篇 |
2019年 | 15篇 |
2018年 | 11篇 |
2017年 | 10篇 |
2016年 | 10篇 |
2015年 | 7篇 |
2014年 | 11篇 |
2013年 | 149篇 |
2010年 | 9篇 |
2009年 | 8篇 |
2008年 | 10篇 |
2007年 | 9篇 |
2006年 | 9篇 |
2004年 | 7篇 |
2003年 | 8篇 |
2002年 | 11篇 |
2001年 | 6篇 |
2000年 | 7篇 |
1998年 | 7篇 |
1997年 | 9篇 |
1996年 | 20篇 |
1995年 | 9篇 |
1994年 | 10篇 |
1993年 | 13篇 |
1992年 | 14篇 |
1991年 | 20篇 |
1990年 | 8篇 |
1989年 | 16篇 |
1988年 | 16篇 |
1987年 | 17篇 |
1986年 | 12篇 |
1985年 | 14篇 |
1984年 | 11篇 |
1983年 | 6篇 |
1982年 | 11篇 |
1981年 | 10篇 |
1980年 | 21篇 |
1979年 | 12篇 |
1978年 | 17篇 |
1976年 | 13篇 |
1975年 | 17篇 |
1974年 | 11篇 |
1973年 | 15篇 |
1972年 | 9篇 |
1971年 | 15篇 |
1970年 | 11篇 |
1969年 | 8篇 |
1968年 | 9篇 |
1967年 | 11篇 |
1966年 | 12篇 |
排序方式: 共有743条查询结果,搜索用时 0 毫秒
261.
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. 相似文献
262.
Using Mills Differential a game value function ?, used in the Kemeny-Morgenstern-Thompson growth model to show the existence of solutions, is discussed. In doing so, several proofs become shorter, in addition known results are seen in a new context. Finally connections between the existence of a so-called economic solution and the differentiability or non-differentiability of function ? are analyzed. 相似文献
263.
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. 相似文献
264.
This article addresses bottleneck linear programming problems and in particular capacitated and constrained bottleneck transportation problems. A pseudopricing procedure based on the poly-ω procedure is used to facilitate the primal simplex procedure. This process allows the recent computational developments such as the Extended Threaded Index Method to be applied to bottleneck transportation problems. The impact on problem solution times is illustrated by computational testing and comparison with other current methods. 相似文献
265.
During the course of the last few years, attacks on the traveling salesman problem have resulted in a variety of often innovative and rather powerful computational procedures. In this article, we present a review of these results for problems defined on weighted and unweighted graphs. Some account of computational behavior for exact algorithms is provided; however, the primary coverage deals with the strategy of particular procedures. In addition, we include some aspects of nonexact algorithms with major interest confined to the establishment of worst-case bounds. 相似文献
266.
The determination as to the cost-effective number of spares for given types of items or equipment to be carried on board various types of ships is studied. This spare pool, known as the ship's COSAL, must provide prespecified levels of protection against stockouts for all uses of that item on board the given ship. This article derives and illustrates the methodology for optimally trading off the reduction in the ship's COSAL that can be gained by improving repair/resupply capabilities or by lowering the failure rate of the equipment through more or different types of preventive maintenance. A flexible class of preventive maintenance/repair response functions to cost is studied which are nonlinear and exhibit realistic diminishing returns. Two different types of assumptions are possible regarding the interdependencies of the resupply times across different ship types. A tractable budget allocation method is presented which can be used in a multiitem, multiship, multiechelon repair environment where there is one budget to cover all spares, all repair/resupply, and preventive maintenance activities. The technique incorporates different criticalities of shortages by type of ship and item. It can be used either in a budget building mode or a budget execution mode. 相似文献
267.
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. 相似文献
268.
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. 相似文献
269.
W. F. Lucas 《海军后勤学研究》1967,14(1):15-21
A unique polyhedral solution is given for most n-person games in partition function form when only partitions into coalitions with 1, n-1, and n players have large payoffs. 相似文献
270.
Richard F. Gebhard 《海军后勤学研究》1967,14(1):55-67
The purpose of this paper is to analyze the effect of a particular control doctrine applied to the service mechanism of a queuing process. A bilevel hysteretic control based on queue length control levels is employed in an M/M/1 queuing system. Expressions are obtained for queue length probabilities, the first two factorial moments of queue length and two figures of merit for describing control performance under the assumption of statistical equilibrium. Computational examples illustrate the effects on queuing processes subject to this type of control. Several cost formulae are considered for comparison of costs when the queue control doctrine is varied. Situations in which hysteretic control is useful are discussed. 相似文献