全文获取类型
收费全文 | 236篇 |
免费 | 9篇 |
出版年
2020年 | 3篇 |
2019年 | 13篇 |
2018年 | 10篇 |
2017年 | 5篇 |
2016年 | 8篇 |
2015年 | 7篇 |
2014年 | 7篇 |
2013年 | 75篇 |
2011年 | 8篇 |
2010年 | 2篇 |
2009年 | 3篇 |
2008年 | 4篇 |
2007年 | 7篇 |
2006年 | 2篇 |
2005年 | 5篇 |
2004年 | 2篇 |
2003年 | 3篇 |
2002年 | 4篇 |
2001年 | 3篇 |
1999年 | 5篇 |
1998年 | 1篇 |
1997年 | 3篇 |
1996年 | 4篇 |
1995年 | 3篇 |
1994年 | 6篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 3篇 |
1988年 | 4篇 |
1987年 | 2篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1983年 | 3篇 |
1981年 | 1篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1976年 | 1篇 |
1975年 | 2篇 |
1974年 | 2篇 |
1973年 | 3篇 |
1972年 | 4篇 |
1971年 | 2篇 |
1970年 | 3篇 |
1969年 | 1篇 |
1968年 | 3篇 |
1967年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有245条查询结果,搜索用时 199 毫秒
1.
2.
3.
Inspection procedures may at times pose a hazard to the system being monitored. In this article, a simple hazardous-inspection model is considered. The character of the optimal ongoing inspection policy (for inspections subsequent to the first) is reviewed, and the possible forms of the optimal initiation policy are established. Efficient computational procedures are developed for calculating optimal policies. Some discussion is included of the counterintuitive nature of some of the results. 相似文献
4.
On 22 September 1979 two optical sensors on U.S. satellite Vela 6911 detected a double-flash of light that appeared characteristic of an atmospheric nuclear explosion conducted over the southern Atlantic or Indian Ocean. It became known as the Vela Incident, Event 747, or Alert 747. An anomaly between the amplitude of the two signals during the second pulse led a U.S. government expert panel established to assess the event to conclude in mid-1980 that a more likely explanation was the impact of a small meteoroid on the satellite, the debris from which reflected sunlight into the sensors' field of view. No model was presented to support the contention, and a similar anomaly—known as background modulation—was a given for the second pulse of all confirmed explosions detected by Vela, though beginning later. Nonetheless, this event has remained the subject of intense debate. This article reviews the evidence and presents an updated analysis of the original Vela signal based on recently declassified literature and on modern knowledge of interplanetary dust and hyper velocity impact. Given the geometry of the satellite, and that the bulk of the surface comprised solar panels, much of the debris from any collision would be carried away from the sensors' field of view. Thus, a meteoroid collision appears much less likely than previously assumed. The double flash is instead consistent with a nuclear explosion, albeit detected by an aged satellite for which background modulation was abnormal and/or commenced earlier, also seen in post-event SYSTEM tests. A companion paper to be published in 2018 presents radionuclide and hydroacoustic evidence supporting the conclusion that the Vela Incident was a nuclear weapon test explosion. 相似文献
5.
A learning tabu search for a truck allocation problem with linear and nonlinear cost components 下载免费PDF全文
The two‐level problem studied in this article consists of optimizing the refueling costs of a fleet of locomotives over a railway network. The goal consists of determining: (1) the number of refueling trucks contracted for each yard (truck assignment problem denoted TAP) and (2) the refueling plan of each locomotive (fuel distribution problem denoted FDP). As the FDP can be solved efficiently with existing methods, the focus is put on the TAP only. In a first version of the problem (denoted (P1)), various linear costs (e.g., fuel, fixed cost associated with each refueling, weekly operating costs of trucks) have to be minimized while satisfying a set of constraints (e.g., limited capacities of the locomotives and the trucks). In contrast with the existing literature on this problem, two types of nonlinear cost components will also be considered, based on the following ideas: (1) if several trucks from the same fuel supplier are contracted for the same yard, the supplier is likely to propose discounted prices for that yard (Problem (P2)); (2) if a train stops too often on its route, a penalty is incurred, which represents the dissatisfaction of the clients (Problem (P3)). Even if exact methods based on a mixed integer linear program formulation are available for (P1), they are not appropriate anymore to tackle (P2) and (P3). Various methods are proposed for the TAP: a descent local search, a tabu search, and a learning tabu search (LTS). The latter is a new type of local search algorithm. It involves a learning process relying on a trail system, and it can be applied to any combinatorial optimization problem. Results are reported and discussed for a large set of instances (for (P1), (P2), and (P3)), and show the good performance of LTS. © 2014 Wiley Periodicals, Inc. 62:32–45, 2015 相似文献
6.
7.
This article treats an elementary optimization problem, where an inbound stream of successive items is to be resequenced with the help of multiple parallel queues in order to restore an intended target sequence. Whenever early items block the one item to be currently released into the target sequence, they are withdrawn from their queue and intermediately stored in an overflow area until their actual release is reached. We aim to minimize the maximum number of items simultaneously stored in the overflow area during the complete resequencing process. We met this problem in industry practice at a large German automobile producer, who has to resequence containers with car seats prior to the assembly process. We formalize the resulting resequencing problem and provide suited exact and heuristic solution algorithms. In our computational study, we also address managerial aspects such as how to properly avoid the negative effects of sequence alterations. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 401–415, 2016 相似文献
8.
9.
10.
This paper considers the production of two products with known demands over a finite set of periods. The production and inventory carrying costs for each product are assumed to be concave. We seek the minimum cost production schedule meeting all demands, without backlogging, assuming that at most one of the two products can be produced in any period. The optimization problem is first stated as a nonlinear programming problem, which allows the proof of a result permitting the search for the optimal policy to be restricted to those which produce a product only when its inventory level is zero. A dynamic programming formulation is given and the model is then formulated as a shortest route problem in a specially constructed network. 相似文献