首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   185篇
  免费   34篇
  国内免费   5篇
  2022年   3篇
  2021年   1篇
  2020年   4篇
  2019年   5篇
  2018年   1篇
  2017年   4篇
  2016年   6篇
  2015年   6篇
  2014年   10篇
  2013年   9篇
  2012年   13篇
  2011年   6篇
  2010年   13篇
  2009年   15篇
  2008年   16篇
  2007年   19篇
  2006年   16篇
  2005年   8篇
  2004年   16篇
  2003年   7篇
  2002年   5篇
  2001年   7篇
  2000年   6篇
  1999年   4篇
  1998年   2篇
  1997年   1篇
  1996年   6篇
  1995年   5篇
  1994年   2篇
  1992年   2篇
  1991年   2篇
  1990年   2篇
  1989年   2篇
排序方式: 共有224条查询结果,搜索用时 15 毫秒
181.
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  相似文献   
182.
What you should know about the vehicle routing problem   总被引:1,自引:0,他引:1  
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  相似文献   
183.
文中讨论了一类二阶椭圆型边值问题正解的唯一性。削弱了文献[1]中主要定理的条件,并将其推广到一般光滑区域,所用方法主要是对格林函数的精细估计。  相似文献   
184.
用代数正则化方法直接将连续的数学模型离散化,然后用Tikhonov正则化方法求解代数方程组,构造稳定的正则化算法,并进行数值仿真,结果是满意的。  相似文献   
185.
本文对规划论中分配问题的目标要求稍作变动,产生了另一类分配问题,并提出了在特定的求解数表中,通过找闭回路即可求得最优分配方案的一种有效的求解方法。  相似文献   
186.
The gradual covering problem   总被引:1,自引:0,他引:1  
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  相似文献   
187.
子集和问题的分治求解   总被引:3,自引:0,他引:3       下载免费PDF全文
介绍了求解子集和问题的一个分治算法。设给定的n个正整数为A(1),A(2),…,A(n-1),A(n),给定的子集和为正整数M,算法的时间复杂性为O(nlog2(M+1)+1),空间复杂性为O(n)。当M较小时,算法复杂性优于二表算法的复杂性。  相似文献   
188.
基层部队开展科学文化教育活动,是培养“四有"军人,加强部队现代化建设的一项战略任务。然而,各级领导对这项活动在思想认识、组织引导、工作力度等方面存在诸多问题,必须在充分认识的基础上,采取多种措施,大力加以解决,在兴趣培养、方法、内容、制度、环境等方面进行改进,切实搞好这项活动,推进部队全面建设。  相似文献   
189.
为正确理解和实施灵巧噪声干扰,基于匹配滤波器理论对灵巧噪声干扰的本质含义进行了分析。指出,灵巧噪声干扰的本质含义是使干扰由多个分量组成,并且使干扰中的每一个分量的频谱都与雷达发射信号的频谱相同,从而使干扰中的每一个分量的功率利用效率都达到最大。最后,从理论和实践2个角度,阐述了与灵巧噪声干扰相关的基本问题,并进行了相应的分析。  相似文献   
190.
In this article, we study item shuffling (IS) problems arising in the logistics system of steel production. An IS problem here is to optimize shuffling operations needed in retrieving a sequence of steel items from a warehouse served by a crane. There are two types of such problems, plate shuffling problems (PSP) and coil shuffling problems (CSP), considering the item shapes. The PSP is modeled as a container storage location assignment problem. For CSP, a novel linear integer programming model is formulated considering the practical stacking and shuffling features. Several valid inequalities are constructed to accelerate the solving of the models. Some properties of optimal solutions of PSP and CSP are also derived. Because of the strong NP‐hardness of the problems, we consider some special cases of them and propose polynomial time algorithms to obtain optimal solutions for these cases. A greedy heuristic is proposed to solve the general problems and its worst‐case performances on both PSP and CSP are analyzed. A tabu search (TS) method with a tabu list of variable length is proposed to further improve the heuristic solutions. Without considering the crane traveling distance, we then construct a rolling variable horizon heuristic for the problems. Numerical experiments show that the proposed heuristic algorithms and the TS method are effective. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号