全文获取类型
收费全文 | 102篇 |
免费 | 2篇 |
出版年
2021年 | 1篇 |
2019年 | 4篇 |
2018年 | 5篇 |
2017年 | 8篇 |
2016年 | 4篇 |
2014年 | 2篇 |
2013年 | 22篇 |
2012年 | 2篇 |
2011年 | 2篇 |
2010年 | 2篇 |
2009年 | 3篇 |
2007年 | 1篇 |
2006年 | 2篇 |
2005年 | 2篇 |
2004年 | 3篇 |
2003年 | 1篇 |
2002年 | 5篇 |
2000年 | 3篇 |
1998年 | 2篇 |
1993年 | 3篇 |
1991年 | 1篇 |
1987年 | 1篇 |
1985年 | 3篇 |
1984年 | 2篇 |
1983年 | 2篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1979年 | 1篇 |
1976年 | 1篇 |
1975年 | 3篇 |
1974年 | 2篇 |
1973年 | 2篇 |
1972年 | 1篇 |
1971年 | 3篇 |
1969年 | 1篇 |
1968年 | 1篇 |
排序方式: 共有104条查询结果,搜索用时 406 毫秒
1.
This article concerns the location of a facility among n points where the points are serviced by “tours” taken from the facility. Tours include m points at a time and each group of m points may become active (may need a tour) with some known probability. Distances are assumed to be rectilinear. For m ≤ 3, it is proved that the objective function is separable in each dimension and an exact solution method is given that involves finding the median of numbers appropriately generated from the problem data. It is shown that the objective function becomes multimodal when some tours pass through four or more points. A bounded heuristic procedure is suggested for this latter case. This heuristic involves solving an auxiliary three-point tour location problem. 相似文献
2.
We first present a survey on the theory of semi-infinite programming as a generalization of linear programming and convex duality theory. By the pairing of a finite dimensional vector space over an arbitrarily ordered field with a generalized finite sequence space, the major theorems of linear programming are generalized. When applied to Euclidean spaces, semi-infinite programming theory yields a dual theorem associating as dual problems minimization of an arbitrary convex function over an arbitrary convex set in n-space with maximization of a linear function in non-negative variables of a generalized finite sequence space subject to a finite system of linear equations. We then present a new generalization of the Kuhn-Tucker saddle-point equivalence theorem for arbitrary convex functions in n-space where differentiability is no longer assumed. 相似文献
3.
4.
Consider an “intractable” optimization problem for which no efficient solution technique exists. Given a systematic procedure for generating independent heuristic solutions, we seek to obtain interval estimates for the globally optimal solution using statistical inference. In previous work, accurate point estimates have been derived. Determining interval estimates, however, is a considerably more difficult task. In this paper, we develop straightforward procedures which compute confidence intervals efficiently in order to evaluate heuristic solutions and assess deviations from optimality. The strategy presented is applicable to a host of combinatorial optimization problems. The assumptions of our model, along with computational experience, are discussed. 相似文献
5.
Christopher G. Pernin Angela O’Mahony Thomas S. Szayna Derek Eaton Katharina Ley Best Elizabeth Bodine-Baron 《Defense & Security Analysis》2017,33(3):209-222
US national security guidance, as well as the US Army’s operational experiences since 2001, emphasizes the importance of working closely with partner countries to achieve US strategic objectives. The US Army has introduced the global landpower network (GLN) concept as a means to integrate, sustain and advance the Army’s considerable ongoing efforts to meet US national security guidance. This study develops the GLN concept further, and addresses three questions. What benefits can the GLN provide the Army? What are the essential components of the GLN? What options exist for implementing the GLN concept? By developing the GLN concept, the Army has the opportunity to transition the GLN from an often ad hoc and reactive set of relationships to one that the Army more self-consciously prioritizes and leverages as a resource to meet US strategic objectives. 相似文献
6.
Many cooperative games, especially ones stemming from resource pooling in queueing or inventory systems, are based on situations in which each player is associated with a single attribute (a real number representing, say, a demand) and in which the cost to optimally serve any sum of attributes is described by an elastic function (which means that the per‐demand cost is non‐increasing in the total demand served). For this class of situations, we introduce and analyze several cost allocation rules: the proportional rule, the serial cost sharing rule, the benefit‐proportional rule, and various Shapley‐esque rules. We study their appeal with regard to fairness criteria such as coalitional rationality, benefit ordering, and relaxations thereof. After showing the impossibility of combining coalitional rationality and benefit ordering, we show for each of the cost allocation rules which fairness criteria it satisfies. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 271–286, 2017 相似文献
7.
In 2013, the staff of the U.S. Nuclear Regulatory Commission estimated the reduction of the off-site economic losses from a fire in a drained U.S. spent fuel pool if fuel that had cooled for more than five years were transferred to dry cask storage—an option it called “expedited transfer.” In this article, it is shown that the savings would be much higher than the NRC estimated. Savings increase to about $2 trillion if: losses beyond 50 miles are included; the land-contamination threshold for long-term population relocation is changed to that used for the Chernobyl and Fukushima accidents and recommended by the U.S. Environmental Protection Agency; and, based on the experience of Japan, decontamination of land areas to levels acceptable for population return is assumed to take at least four years. If expedited transfer were implemented, the off-site economic losses would be reduced by about 98%. 相似文献
8.
9.
Joseph O. Chapa 《Journal of Military Ethics》2017,16(3-4):256-271
In this paper I argue that a remotely piloted aircraft (RPA) pilot’s act of killing remotely, when it is done in the defense of another person, can be viewed as an act of sacrifice. This argument concludes from two premises. First, the RPA pilot faces psychological risk to self by carrying out such an action; second, the RPA pilot is motivated to some significant degree by something other than self-interest. Moreover, I challenge both the view that RPA represent merely an incremental development in technology yielding an incremental expansion of the distance between the war-fighter and the target and the view that RPA is revolutionary in some fundamental sense. I instead argue that, based upon the natural geometric boundary imposed by the earth’s shape, RPA have maximized the physical distance between the war-fighter and the target and, over time, this fact will change, not only the psychological effects on the RPA pilot, but also the way we view killing and distance in general. When taken together, these two broad claims, that other-defense can justify killing in war and that there is a psychological cost paid by remote killers, yield a conception of remote killing as an act of sacrifice that will inform the broader conversation about ethics, risk, killing, and RPA. 相似文献
10.
The correlated improvement in yield and reliability has been observed in the case studies on integrated circuits and electronic assemblies. This paper presents a model that incorporates yield and reliability with the addition of a burn‐in step to explain their correlated improvement. The proposed model includes as special cases several yield and reliability models that have been previously published and thus provides a unifying framework. The model is used to derive a condition for which yield functions can be multiplied to obtain the overall yield. Yield and reliability are compared as a function of operation time, and an analytical condition for burn‐in to be effective is also obtained. Finally, Poisson and negative binomial defects models are further considered to investigate how reliability is based on yield. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献