全文获取类型
收费全文 | 633篇 |
免费 | 19篇 |
出版年
2021年 | 12篇 |
2019年 | 25篇 |
2018年 | 18篇 |
2017年 | 13篇 |
2016年 | 13篇 |
2015年 | 15篇 |
2014年 | 14篇 |
2013年 | 122篇 |
2009年 | 9篇 |
2007年 | 7篇 |
2006年 | 5篇 |
2005年 | 10篇 |
2004年 | 10篇 |
2003年 | 10篇 |
2002年 | 8篇 |
2001年 | 6篇 |
2000年 | 10篇 |
1999年 | 5篇 |
1998年 | 8篇 |
1997年 | 19篇 |
1996年 | 9篇 |
1995年 | 5篇 |
1994年 | 12篇 |
1993年 | 6篇 |
1992年 | 6篇 |
1991年 | 16篇 |
1990年 | 8篇 |
1989年 | 11篇 |
1988年 | 14篇 |
1987年 | 16篇 |
1986年 | 13篇 |
1985年 | 7篇 |
1984年 | 6篇 |
1983年 | 11篇 |
1982年 | 8篇 |
1981年 | 6篇 |
1980年 | 10篇 |
1979年 | 14篇 |
1978年 | 7篇 |
1977年 | 9篇 |
1976年 | 10篇 |
1975年 | 9篇 |
1974年 | 12篇 |
1973年 | 14篇 |
1972年 | 9篇 |
1971年 | 10篇 |
1970年 | 10篇 |
1969年 | 9篇 |
1968年 | 7篇 |
1967年 | 5篇 |
排序方式: 共有652条查询结果,搜索用时 15 毫秒
471.
This paper presents a statistical decision analysis of a one-stage linear programming problem with deterministic constraints and stochastic criterion function. Procedures for obtaining numerical results are given which are applicable to any problem having this general form. We begin by stating the statistical decision problems to be considered, and then discuss the expected value of perfect information and the expected value of sample information. In obtaining these quantities, use is made of the distribution of the optimal value of the linear programming problem with stochastic criterion function, and so we discuss Monte Carlo and numerical integration procedures for estimating the mean of this distribution. The case in which the random criterion vector has a multivariate Normal distribution is discussed separately, and more detailed methods are offered. We discuss dual problems, including some relationships of this work with other work in probabilistic linear programming. An example is given in Appendix A showing application of the methods to a sample problem. In Appendix B we consider the accuracy of a procedure for approximating the expected value of information. 相似文献
472.
F. M. Scherer 《海军后勤学研究》1966,13(1):71-82
This paper explores the relationship between research project cost and expected time to completion under various scheduling strategies; it assumes that many potential technical approaches to the research problem can be identified; and that each approach has a low but finite subjective probability of success. It is shown that under a variety of assumptions, expected time to project completion can be reduced, but that as a result expected project cost rises at an increasing rate. Some cases in which this convex time-cost tradeoff relationship might not hold generally are identified. When the time-cost tradeoff function is convex, the desirability of concurrent as opposed to series scheduling of approaches depends crucially upon the depth of the stream of benefits expected to be realized upon successful project completion. The deeper the benefit stream is, the more desirable concurrent scheduling is. 相似文献
473.
Satellite constellation design for forest fire monitoring via a stochastic programing approach
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
There is significant value in the data collected by satellites during and after a natural disaster. The current operating paradigm in practice is for satellites to passively collect data when they happen to fly over a disaster location. Conversely, this article considers the alternative approach of actively maneuvering satellites to fly directly overhead of the disaster site on a routine basis. Toward this end, we seek to compute a satellite constellation design that minimizes the expected maneuver costs for monitoring an unknown forest fire. In this article, we present a 2‐stage stochastic programing model for this problem as well as a accelerated L‐shaped decomposition approach. A comparison between our approach and the current operating paradigm indicates that our solution provides longer duration data collections and a greater number of data collections. Analysis also shows that our proposed solution is robust over a wide array of scenarios. 相似文献
474.
475.
This article deals with the problem of minimizing the transportation and inventory cost associated with the shipment of several products from a source to a destination, when a finite set of shipping frequencies is available. A mixed-integer programming model—shown to be NP-hard—is formulated for that problem. The computational complexity of some similar models applied to different problems is also investigated. In particular, whereas the capacitated plant location problem with operational cost in product form is NP-hard, the simple plant location problem with the same characteristics can be solved in polynomial time. A branch-and-bound algorithm is finally worked out, and some computational results are presented. © 1996 John Wiley & Sons, Inc. 相似文献
476.
Myron M. Melenevsky 《海军后勤学研究》1996,43(3):335-348
This article deals with “newness,” an important characteristic of research-and-development (R&D) projects. Newness consumes resources and provides effectiveness or profit, and is mainly considered to be of a qualitative nature yielding only to an expert's intuition. This article is focused on a numerical measure of newness and the closely connected concept of technological advance. The measure is described in a technical parameter space against a set of analogous objects, presented by its center, eigenvalues and eigenvectors. Specific features and behavior of the selected measure of newness are analyzed. A numerical example is also included. © 1996 John Wiley & Sons, Inc. 相似文献
477.
We describe a modification of Brown's fictitious play method for solving matrix (zero-sum two-person) games and apply it to both symmetric and general games. If the original game is not symmetric, the basic idea is to transform the given matrix game into an equivalent symmetric game (a game with a skew-symmetric matrix) and use the solution properties of symmetric games (the game value is zero and both players have the same optimal strategies). The fictitious play method is then applied to the enlarged skew-symmetric matrix with a modification that calls for the periodic restarting of the process. At restart, both players' strategies are made equal based on the following considerations: Select the maximizing or minimizing player's strategy that has a game value closest to zero. We show for both symmetric and general games, and for problems of varying sizes, that the modified fictitious play (MFP) procedure approximates the value of the game and optimal strategies in a greatly reduced number of iterations and in less computational time when compared to Brown's regular fictitious play (RFP) method. For example, for a randomly generated 50% dense skew-symmetric 100 × 100 matrix (symmetric game), with coefficients |aij| ≤ 100, it took RFP 2,652,227 iterations to reach a gap of 0.03118 between the lower and upper bounds for the game value in 70.71 s, whereas it took MFP 50,000 iterations to reach a gap of 0.03116 in 1.70 s. Improved results were also obtained for general games in which the MFP solves a much larger equivalent symmetric game. © 1996 John Wiley & Sons, Inc. 相似文献
478.
479.
An area to be defended consists of separated point targets. These targets are subject to an attack in which the offensive weapons are assumed to arrive simultaneously. The defense has area defenders, each of which is capable of intercepting any attacker. The defense has no impact-point prediction; that is, it has no knowledge of any attacker's destination prior to allocation of area interceptors. For a given attack, the defense wishes to allocate its interceptors to maximize the total expected survival value of the targets. For a given attack size, the offense seeks a strategy to minimize total expected surviving value against best defense. We determine an optimal defensive strategy directly and develop an algorithm to determine an optimal attack and the optimal value of the min-max problem. A dynamic programming technique is used to obtain integer solutions, and illustrative computational results are provided. 相似文献
480.
Until recently, fast algorithms for the maximum flow problem have typically proceeded by constructing layered networks and establishing blocking flows in these networks. However, in recent years, new distance-directed algorithms have been suggested that do not construct layered networks but instead maintain a distance label with each node. The distance label of a node is a lower bound on the length of the shortest augmenting path from the node to the sink. In this article we develop two distance-directed augmenting path algorithms for the maximum flow problem. Both the algorithms run in O(n2m) time on networks with n nodes and m arcs. We also point out the relationship between the distance labels and layered networks. Using a scaling technique, we improve the complexity of our distance-directed algorithms to O(nm log U), where U denotes the largest arc capacity. We also consider applications of these algorithms to unit capacity maximum flow problems and a class of parametric maximum flow problems. 相似文献