全文获取类型
收费全文 | 286篇 |
免费 | 2篇 |
国内免费 | 1篇 |
专业分类
289篇 |
出版年
2024年 | 1篇 |
2023年 | 1篇 |
2022年 | 4篇 |
2021年 | 3篇 |
2020年 | 7篇 |
2019年 | 6篇 |
2018年 | 1篇 |
2017年 | 6篇 |
2016年 | 7篇 |
2015年 | 9篇 |
2014年 | 11篇 |
2013年 | 10篇 |
2012年 | 16篇 |
2011年 | 8篇 |
2010年 | 15篇 |
2009年 | 19篇 |
2008年 | 18篇 |
2007年 | 20篇 |
2006年 | 22篇 |
2005年 | 14篇 |
2004年 | 19篇 |
2003年 | 8篇 |
2002年 | 8篇 |
2001年 | 7篇 |
2000年 | 7篇 |
1999年 | 4篇 |
1998年 | 2篇 |
1997年 | 2篇 |
1996年 | 7篇 |
1995年 | 7篇 |
1994年 | 7篇 |
1993年 | 2篇 |
1992年 | 3篇 |
1991年 | 3篇 |
1990年 | 2篇 |
1989年 | 3篇 |
排序方式: 共有289条查询结果,搜索用时 15 毫秒
271.
In this paper we investigate the gradual covering problem. Within a certain distance from the facility the demand point is fully covered, and beyond another specified distance the demand point is not covered. Between these two given distances the coverage is linear in the distance from the facility. This formulation can be converted to the Weber problem by imposing a special structure on its cost function. The cost is zero (negligible) up to a certain minimum distance, and it is a constant beyond a certain maximum distance. Between these two extreme distances the cost is linear in the distance. The problem is analyzed and a branch and bound procedure is proposed for its solution. Computational results are presented. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
272.
Gilbert Laporte 《海军后勤学研究》2007,54(8):811-819
In the Vehicle Routing Problem (VRP), the aim is to design a set of m minimum cost vehicle routes through n customer locations, so that each route starts and ends at a common location and some side constraints are satisfied. Common applications arise in newspaper and food delivery, and in milk collection. This article summarizes the main known results for the classical VRP in which only vehicle capacity constraints are present. The article is structured around three main headings: exact algorithms, classical heuristics, and metaheuristics. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
273.
In this study, we propose a new parsimonious policy for the stochastic joint replenishment problem in a single‐location, N‐item setting. The replenishment decisions are based on both group reorder point‐group order quantity and the time since the last decision epoch. We derive the expressions for the key operating characteristics of the inventory system for both unit and compound Poisson demands. In a comprehensive numerical study, we compare the performance of the proposed policy with that of existing ones over a standard test bed. Our numerical results indicate that the proposed policy dominates the existing ones in 100 of 139 instances with comparably significant savings for unit demands. With batch demands, the savings increase as the stochasticity of demand size gets larger. We also observe that it performs well in environments with low demand diversity across items. The inventory system herein also models a two‐echelon setting with a single item, multiple retailers, and cross docking at the upper echelon. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
274.
275.
276.
提出一款具有多层辐射叶结构的新型鞭状天线,在10 m鞭状天线体上设置不同的辐射叶层数、半径、长度、分支数、仰角及其分布情况,研究其对天线辐射性能的影响,综合考虑选择一套最合适的辐射叶结构,并为天线进行双加载和宽带匹配网络的算法优化。仿真结果表明,与现有的普通宽带鞭状天线相比,增益和效率得到了普遍提高,在低频段增益最高提高了3 dB,效率最高提高了5%;在高频段增益最高提高了5 dB,效率最高提高了35%,方向图上翘也得到了一定的抑制,为改善现有的宽带鞭状天线提供一种新的结构设计方法。 相似文献
277.
Y-切石英晶体的各向异性物理特性,使它在正碰撞或平面冲击波作用条件下能产生压剪波的传播,为实现对材料的压剪加载实验研究提供了条件。由于石英晶体的压电效应,国外采用了VISAR技术进行测试。在我们的工作中,首次尝试用锰铜压阻法和电磁质速测量法进行测试。压电效应造成了明显的干扰,妨碍信号的获取。实验中用磁控溅射方法将石英晶体表面镀银层约1μm,达到了中和极化电荷、屏蔽极化电场的目的,比较成功地消除了压电干扰,获得了有效的测试信号。 相似文献
278.
279.
280.