全文获取类型
收费全文 | 313篇 |
免费 | 121篇 |
国内免费 | 13篇 |
出版年
2024年 | 2篇 |
2023年 | 8篇 |
2022年 | 1篇 |
2021年 | 8篇 |
2020年 | 9篇 |
2019年 | 12篇 |
2018年 | 8篇 |
2017年 | 20篇 |
2016年 | 26篇 |
2015年 | 17篇 |
2014年 | 26篇 |
2013年 | 17篇 |
2012年 | 24篇 |
2011年 | 24篇 |
2010年 | 21篇 |
2009年 | 36篇 |
2008年 | 29篇 |
2007年 | 25篇 |
2006年 | 28篇 |
2005年 | 22篇 |
2004年 | 20篇 |
2003年 | 10篇 |
2002年 | 13篇 |
2001年 | 9篇 |
2000年 | 3篇 |
1999年 | 10篇 |
1998年 | 7篇 |
1997年 | 2篇 |
1996年 | 2篇 |
1992年 | 2篇 |
1991年 | 3篇 |
1990年 | 1篇 |
1989年 | 2篇 |
排序方式: 共有447条查询结果,搜索用时 234 毫秒
411.
Logistical planning problems are complicated in practice because planners have to deal with the challenges of demand planning and supply replenishment, while taking into account the issues of (i) inventory perishability and storage charges, (ii) management of backlog and/or lost sales, and (iii) cost saving opportunities due to economies of scale in order replenishment and transportation. It is therefore not surprising that many logistical planning problems are computationally difficult, and finding a good solution to these problems necessitates the development of many ad hoc algorithmic procedures to address various features of the planning problems. In this article, we identify simple conditions and structural properties associated with these logistical planning problems in which the warehouse is managed as a cross‐docking facility. Despite the nonlinear cost structures in the problems, we show that a solution that is within ε‐optimality can be obtained by solving a related piece‐wise linear concave cost multi‐commodity network flow problem. An immediate consequence of this result is that certain classes of logistical planning problems can be approximated by a factor of (1 + ε) in polynomial time. This significantly improves upon the results found in literature for these classes of problems. We also show that the piece‐wise linear concave cost network flow problem can be approximated to within a logarithmic factor via a large scale linear programming relaxation. We use polymatroidal constraints to capture the piece‐wise concavity feature of the cost functions. This gives rise to a unified and generic LP‐based approach for a large class of complicated logistical planning problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
412.
413.
414.
415.
为降低鲁棒优化模型最优解的保守性,以最小化违约车辆数和总惩罚成本为目标,建立针对旅行时间不确定的开放式车辆路径问题的弱鲁棒优化模型。对于不确定数据集的每个取值,该模型的最优解可以使其目标函数值始终不超过某数值,进而改善最优解的保守性。为提高启发式算法发现最优解的概率,提出一种自设计遗传算法对模型进行求解,其主要思想是利用粒子群算法搜索出可使遗传算法预期产生最好解的算法要素,并将其进行组合,从而产生新的遗传算法。采用新产生的遗传算法对模型继续求解,输出最好解。计算结果表明:与以往的鲁棒优化方法相比,弱鲁棒优化方法的最优解的保守性显著降低。 相似文献
416.
417.
Raymond Hinnebusch 《Small Wars & Insurgencies》2018,29(3):391-413
AbstractThe problematic export of the Westphalian system to MENA is examined, taking Syria as exemplar. The export model is juxtaposed to actual non-lineal trajectories, semi-sovereignty and hybrid or failing states. This is manifested in post-uprising Syria in failing statehood, fragmented and overlapping governance, permeable and collapsing borders, the loss of sovereignty to trans-state movements, “competitive regime-building” between the Asad regime and jihadist warlords, and “competitive interventionism” by external powers filling the governance vacuum with their own proxies. The result is heterarchic zones of limited statehood in which state sovereignty is contested by both international (supra-state) penetration and sub-state fragmentation. 相似文献
418.
分析比较当前大数据中心典型混合存储架构,针对其不能综合运用存储管理系统和存储设备优势的问题,提出软硬件协同的数据放置策略,同时考虑软件层混合存储管理系统和硬件层混合存储设备的特点,根据应用特性为数据选择合适的存储管理系统和设备。面向不同应用场景,提出运行前规划存储路径的静态放置模式和运行中规划存储路径的动态放置模式。基于存储管理系统和设备性能参数建模,采用仿真方法实现各数据放置策略,并运行实际应用中的三类负载进行实验测试,结果表明采用软硬件协同的数据放置策略相比只考虑存储管理系统和存储设备的数据放置策略,性能可以提高近30%。 相似文献
419.
420.
风扇蜗壳排气段结构优化研究 总被引:1,自引:0,他引:1
为有效降低车辆封闭式冷却风道中风扇蜗壳的空气流动阻力,提出了计算流体力学分析与遗传算法相结合的蜗壳排气段结构优化方法,建立了蜗壳结构优化模型,开发了优化算法可执行程序Control CFD.EXE。对某车辆的风扇蜗壳排气段进行了结构优化。优化后蜗壳排气段的空气流动阻力比优化前减小了10.1%,空气质量流量增大了1.70%。 相似文献