全文获取类型
收费全文 | 488篇 |
免费 | 0篇 |
专业分类
488篇 |
出版年
2021年 | 11篇 |
2019年 | 20篇 |
2018年 | 10篇 |
2017年 | 10篇 |
2016年 | 11篇 |
2015年 | 11篇 |
2014年 | 9篇 |
2013年 | 93篇 |
2011年 | 4篇 |
2009年 | 5篇 |
2008年 | 5篇 |
2007年 | 5篇 |
2006年 | 5篇 |
2005年 | 9篇 |
2004年 | 8篇 |
2003年 | 6篇 |
2002年 | 6篇 |
2001年 | 4篇 |
2000年 | 7篇 |
1999年 | 4篇 |
1998年 | 8篇 |
1997年 | 15篇 |
1996年 | 7篇 |
1994年 | 10篇 |
1992年 | 4篇 |
1991年 | 13篇 |
1990年 | 4篇 |
1989年 | 7篇 |
1988年 | 7篇 |
1987年 | 14篇 |
1986年 | 8篇 |
1985年 | 6篇 |
1984年 | 5篇 |
1983年 | 8篇 |
1982年 | 8篇 |
1981年 | 5篇 |
1980年 | 7篇 |
1979年 | 11篇 |
1978年 | 7篇 |
1977年 | 8篇 |
1976年 | 7篇 |
1975年 | 7篇 |
1974年 | 7篇 |
1973年 | 12篇 |
1972年 | 6篇 |
1971年 | 6篇 |
1970年 | 7篇 |
1969年 | 6篇 |
1968年 | 5篇 |
1967年 | 5篇 |
排序方式: 共有488条查询结果,搜索用时 0 毫秒
271.
David M. Malon 《海军后勤学研究》1990,37(6):847-854
Many coherent systems are configurations of identically structured modules, each consisting of a number of different components. The objective is to assemble the modules out of a collection of available components, and to install the modules in the system in a way that maximizes reliability. The greedy assembly rule builds one module out of the best available components, another out of the best remaining components, and so on. This article shows that greedy assembly is optimal whenever the modules have a series structure, no matter what the structure of the system in which the modules will be used might be, provided that the modules, once assembled, are installed in the system in an optimal way. The article also demonstrates that series modules are unique in this regard. 相似文献
272.
Adam D.M. Svendsen 《Defense & Security Analysis》2012,28(3):234-246
Adopting the analytical framework of the established interpretive “schools” of Anglo-American relations, this article offers several reflections on UK–US defense relations as they occurred over the significant years of 2000–2005. During those years, trajectories were established on which UK–US defense relations continue to travel today and outcomes emerged which are still being navigated. This article concludes that the Latin phrase, “Flectas Non Frangas” (essentially translated as: “Bend not Break”), is the most appropriate to adopt to characterize the developments undergone in recent UK–US defense relations. Many historical and strategic lessons with contemporary relevance are drawn. 相似文献
273.
This paper presents several models for the location of facilities subject to congestion. Motivated by applications to locating servers in communication networks and automatic teller machines in bank systems, these models are developed for situations in which immobile service facilities are congested by stochastic demand originating from nearby customer locations. We consider this problem from three different perspectives, that of (i) the service provider (wishing to limit costs of setup and operating servers), (ii) the customers (wishing to limit costs of accessing and waiting for service), and (iii) both the service provider and the customers combined. In all cases, a minimum level of service quality is ensured by imposing an upper bound on the server utilization rate at a service facility. The latter two perspectives also incorporate queueing delay costs as part of the objective. Some cases are amenable to an optimal solution. For those cases that are more challenging, we either propose heuristic procedures to find good solutions or establish equivalence to other well‐studied facility location problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
274.
Like airlines and hotels, sports teams and entertainment venues can benefit from revenue management efforts for their ticket sales. Teams and entertainment venues usually offer bundles of tickets early in their selling horizon and put single‐event tickets on sale at a later date; these organizations must determine the best time to offer individual tickets because both types of ticket sales consume the same fixed inventory. We model the optimal a priori timing decision for a seller with a fixed number of identical tickets to switch from selling the tickets as fixed bundles to individual tickets to maximize the revenue realized before the start of the performance season. We assume that bundle and single‐ticket customers each arrive according to independent, nonhomogeneous Markovian death processes with a linear death rate that can vary over time and that the benefit from selling a ticket in a package is higher than from selling the ticket individually. We characterize the circumstances in which it is optimal for the seller to practice mixed bundling and when the seller should only sell bundles or individual tickets, and we establish comparative statics for the optimal timing decision for the special case of constant customer arrival rates. We extend our analytical results to find the optimal time for offering two groups of tickets with high and low demand. Finally, we apply the timing model to a data set obtained from the sports industry. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
275.
276.
This paper considers the search for an evader concealed in one of two regions, each of which is characterized by its detection probability. The single-sided problem, in which the searcher is told the probability of the evader being located in a particular region, has been examined previously. We shall be concerned with the double-sided problem in which the evader chooses this probability secretly, although he may not subsequently move: his optimal strategy consists of that probability distribution which maximizes the expected time to detection, while the searcher's optimal strategy is the sequence of searches which limits the evader to this expected time. It transpires for this problem that optimal strategies for both searcher and evader may generally be obtained to a surprisingly good degree of approximation by using the optimal strategies for the closely related (but far more easily solved) problem in which the evader is completely free to move between searches. 相似文献
277.
Gary M. Roodman 《海军后勤学研究》1972,19(3):435-447
The procedures for postoptimality analysis that are so much a part of linear programming studies have no simple counterparts in an integer programming context. In the case of Balas' Additive Algorithm, however, it would appear that the capacity of the technique to facilitate certain types of postoptimality analysis has not been fully exploited. This paper proposes an extension of the additive algorithm that utilizes insights generated while solving the original problem to do subsequent analysis upon it. In particular, procedures are developed for doing limited parameter ranging and for seeking new optima in light of parameter changes. 相似文献
278.
Richard M. Simon 《海军后勤学研究》1972,19(1):1-14
A reliability model for multicomponent multistate systems is presented. This is a generalization of a model previously studied by Hirsch, Meisner, and Boll. In the earlier model, when a failure occurs for which no replacement spare is available, the locations using the same type of part as that having failed are “cannibalized” so as to allocate the shortages to locations where they are least detrimental to system performance. Here, we permit certain restrictions to be imposed upon the cannibalization procedure, and develop effective techniques for relating the probability laws governing the level of system performance to the system structure, cannibalization policy, kit of spare parts, and part reliabilities. 相似文献
279.
In an ordered sample from a given population, a few of the consecutive observations from somewhere in the middle may be missing Further, we may be constrained to use a few, and not all, of the remaining observations for purposes of estimation of population parameters. In this paper, such a situation is considered for the double exponential distribution and best linear unbiased estimates are obtained for its parameters, based on a choice of an optimum set of order statistics when the number of observations in the set are prefixed. 相似文献
280.
Myerson 3 and 4 proposed and characterized a modification of the Shapley value in the context of communication situations. In this paper we propose several characterizations of the extension of the Banzhaf value proposed by Owen 7 to communication situations. In particular we characterize this value with the properties of fairness, isolation, and pairwise merging. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献