全文获取类型
收费全文 | 133篇 |
免费 | 2篇 |
出版年
2019年 | 2篇 |
2018年 | 1篇 |
2017年 | 1篇 |
2016年 | 5篇 |
2015年 | 2篇 |
2014年 | 4篇 |
2013年 | 48篇 |
2011年 | 1篇 |
2010年 | 2篇 |
2009年 | 1篇 |
2008年 | 3篇 |
2005年 | 1篇 |
2004年 | 1篇 |
2001年 | 1篇 |
1998年 | 3篇 |
1997年 | 1篇 |
1996年 | 3篇 |
1995年 | 2篇 |
1993年 | 3篇 |
1992年 | 5篇 |
1991年 | 3篇 |
1990年 | 2篇 |
1989年 | 1篇 |
1986年 | 3篇 |
1985年 | 3篇 |
1984年 | 1篇 |
1983年 | 2篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1979年 | 4篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1976年 | 2篇 |
1975年 | 1篇 |
1973年 | 2篇 |
1972年 | 4篇 |
1971年 | 1篇 |
1970年 | 3篇 |
1969年 | 2篇 |
1967年 | 3篇 |
1966年 | 3篇 |
排序方式: 共有135条查询结果,搜索用时 31 毫秒
101.
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'. Furthermore, the defense has impact-point prediction, i.e., it has knowledge of each attacker's intended target prior to allocation of the area interceptors. For a given attack, the defense wishes to allocate its interceptors against attackers so as to maximize the expected total survival value of the targets. In its first move, the offense seeks an attack allocation which will minimize expected total surviving value against best defense. We develop an algorithm to determine optimal attack and defense strategies and the optimal value of this sequential min-max problem. Branch-and-bound techniques are used to obtain integer solutions, and illustrative computational results are provided. 相似文献
102.
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. 相似文献
103.
Previous research on the scheduling of multimachine systems has generally focused on the optimization of individual performance measures. This article considers the sequencing of jobs through a multimachine flow shop, where the quality of the resulting schedule is evaluated according to the associated levels of two scheduling criteria, schedule makespan (Cmax) and maximum job tardiness (Tmax). We present constructive procedures that quantify the trade-off between Cmax and Tmax. The significance of this trade-off is that the optimal solution for any preference function involving only Cmax and Tmax must be contained among the set of efficient schedules that comprise the trade-off curve. For the special case of two-machine flow shops, we present an algorithm that identifies the exact set of efficient schedules. Heruistic procedures for approximating the efficient set are also provided for problems involving many jobs or larger flow shops. Computational results are reported for the procedures which indicate that both the number of efficient schedules and the error incurred by heuristically approximating the efficient set are quite small. 相似文献
104.
Kathryn M. Schumacher Richard Li‐Yang Chen Amy E.M. Cohn Jeremy Castaing 《海军后勤学研究》2016,63(3):236-246
We consider the problem of determining the capacity to assign to each arc in a given network, subject to uncertainty in the supply and/or demand of each node. This design problem underlies many real‐world applications, such as the design of power transmission and telecommunications networks. We first consider the case where a set of supply/demand scenarios are provided, and we must determine the minimum‐cost set of arc capacities such that a feasible flow exists for each scenario. We briefly review existing theoretical approaches to solving this problem and explore implementation strategies to reduce run times. With this as a foundation, our primary focus is on a chance‐constrained version of the problem in which α% of the scenarios must be feasible under the chosen capacity, where α is a user‐defined parameter and the specific scenarios to be satisfied are not predetermined. We describe an algorithm which utilizes a separation routine for identifying violated cut‐sets which can solve the problem to optimality, and we present computational results. We also present a novel greedy algorithm, our primary contribution, which can be used to solve for a high quality heuristic solution. We present computational analysis to evaluate the performance of our proposed approaches. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 236–246, 2016 相似文献
105.
106.
107.
108.
109.
110.