全文获取类型
收费全文 | 437篇 |
免费 | 5篇 |
出版年
2019年 | 4篇 |
2018年 | 8篇 |
2017年 | 8篇 |
2016年 | 11篇 |
2015年 | 6篇 |
2014年 | 4篇 |
2013年 | 135篇 |
2010年 | 5篇 |
2008年 | 4篇 |
2007年 | 3篇 |
2006年 | 3篇 |
2005年 | 8篇 |
2004年 | 3篇 |
2003年 | 6篇 |
2002年 | 7篇 |
2000年 | 5篇 |
1999年 | 5篇 |
1997年 | 4篇 |
1996年 | 6篇 |
1995年 | 7篇 |
1994年 | 8篇 |
1993年 | 8篇 |
1992年 | 5篇 |
1991年 | 6篇 |
1990年 | 3篇 |
1989年 | 8篇 |
1988年 | 7篇 |
1987年 | 10篇 |
1986年 | 10篇 |
1985年 | 6篇 |
1984年 | 3篇 |
1983年 | 4篇 |
1982年 | 9篇 |
1981年 | 3篇 |
1980年 | 6篇 |
1979年 | 5篇 |
1978年 | 9篇 |
1977年 | 5篇 |
1976年 | 4篇 |
1975年 | 7篇 |
1974年 | 7篇 |
1973年 | 6篇 |
1972年 | 8篇 |
1971年 | 10篇 |
1970年 | 5篇 |
1969年 | 8篇 |
1968年 | 7篇 |
1967年 | 3篇 |
1966年 | 3篇 |
1948年 | 3篇 |
排序方式: 共有442条查询结果,搜索用时 15 毫秒
231.
Facility location problems in the plane are among the most widely used tools of Mathematical Programming in modeling real-world problems. In many of these problems restrictions have to be considered which correspond to regions in which a placement of new locations is forbidden. We consider center and median problems where the forbidden set is a union of pairwise disjoint convex sets. As applications we discuss the assembly of printed circuit boards, obnoxious facility location and the location of emergency facilities. © 1995 John Wiley & Sons, Inc. 相似文献
232.
233.
234.
Peter John Brobst 《Defense & Security Analysis》2000,16(2):219-221
235.
Technologically advanced aircraft rely on robust and responsive logistics systems to ensure a high state of operational readiness. This paper fills a critical gap in the literature for combat models by closely relating effectiveness of the logistics system to determinants of success in combat. We present a stochastic diffusion model of an aerial battle between Blue and Red forces. The number of aircraft of Blue forces aloft and ready to be aloft on combat missions is limited by the maximum number of assigned aircraft, the reliability of aircraft subsystems, and the logistic system's ability to repair and replenish those subsystems. Our parsimonious model can illustrate important trade‐offs between logistics decision variables and operational success. 相似文献
236.
The object of this article is to investigate the risk-pooling effect of depot stock in two-echelon distribution system in which the depot serves n retailers in parallel, and to develop computationally tractable optimization procedures for such systems. The depot manager has complete information about stock levels and there are two opportunities to allocate stock to the retailers within each order cycle. We identify first- and second-order aspects to the risk-pooling effect. In particular, the second-order effect is the property that the minimum stock available to any retailer after the second allocation converges in probability to a constant as the number of retailers in the system increases, assuming independence of the demands. This property is exploited in the development of efficient procedures to determine near-optimal values of the policy parameters. 相似文献
237.
The optimal linear combination of control variates in the presence of asymptotically negligible bias
The optimal linear combination of control variates is well known when the controls are assumed to be unbiased. We derive here the optimal linear combination of controls in the situation where asymptotically negligible bias is present. The small-sample linear control which minimizes the mean square error (MSE) is derived. When the optimal asymptotic linear control is used rather than the optimal small-sample control, the degradation in MSE is c/n3, where n is the sample size and c is a known constant. This analysis is particulary relevant to the small-sample theory for control variates as applied to the steady-state estimation problem. Results for the method of multiple estimates are also given. 相似文献
238.
John Miltenburg 《海军后勤学研究》1993,40(7):905-924
JIT (just-in-time) is widely regarded as an excellent tool for reducing costs and cycle times, and for improving quality in manufacturing operations. JIT follows a multistep procedure. First, it identifies and prioritizes wastes or non-value-adding activities. Second, it forces these wastes to be removed. MRP (materials requirements planning) can identify the same wastes and prioritize them in the same way that JIT does, by using data from the MRP database and master production schedule, and a waste identification model. In this article, a model is developed which describes the process by which the classic JIT system identifies and prioritizes waste. An equivalent MRP waste identification model is then developed for the production environment of the classic JIT system. (The classic JIT system was developed to produce many products having low to medium volumes.) The results developed here can be extended to other production environments where adaptations of the classic JIT system are used. An example, taken from an actual application, is presented to illustrate the models and the equivalence of JIT and MRP as systems for identifying and prioritizing wastes in manufacturing. © 1993 John Wiley & Sons, Inc. 相似文献
239.
Modification of algorithms designed for scalar computing, to take advantage of vector processing, raises several challenges. This article presents the vectorization of the primal simplex based network algorithm and results in a 50% improvement in computational time. One of the major contributors to this improvement is the matching of the size of the pricing candidate list to the vector register size. The side constraints are relaxed into a single surrogate constraint. The single constraint network algorithm is vectorized and used as the basis for solving large-scale constrained network problems. Computational experiments are presented which illustrate the vectorization of the network code as well as the ability of the surrogate constraint approach to deal with large constrained network problems. 相似文献
240.
John M. Auger 《海军后勤学研究》1991,38(4):511-529
An infiltrator, starting at a safe base, tries to pass, undetected by a guard and within a time limit, along one of k nonintersecting arcs to a safe destination. Optimal strategies and the value are obtained for this discrete zero-sum search-evasion game. 相似文献