全文获取类型
收费全文 | 237篇 |
免费 | 71篇 |
国内免费 | 8篇 |
出版年
2023年 | 1篇 |
2022年 | 4篇 |
2021年 | 1篇 |
2020年 | 5篇 |
2019年 | 7篇 |
2018年 | 2篇 |
2017年 | 8篇 |
2016年 | 14篇 |
2015年 | 11篇 |
2014年 | 12篇 |
2013年 | 13篇 |
2012年 | 21篇 |
2011年 | 9篇 |
2010年 | 16篇 |
2009年 | 19篇 |
2008年 | 19篇 |
2007年 | 23篇 |
2006年 | 20篇 |
2005年 | 9篇 |
2004年 | 19篇 |
2003年 | 8篇 |
2002年 | 5篇 |
2001年 | 12篇 |
2000年 | 8篇 |
1999年 | 6篇 |
1998年 | 3篇 |
1997年 | 6篇 |
1996年 | 10篇 |
1995年 | 6篇 |
1994年 | 3篇 |
1993年 | 1篇 |
1992年 | 2篇 |
1991年 | 5篇 |
1990年 | 5篇 |
1989年 | 3篇 |
排序方式: 共有316条查询结果,搜索用时 15 毫秒
301.
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 相似文献
302.
This article analyzes a capacity/inventory planning problem with a one‐time uncertain demand. There is a long procurement leadtime, but as some partial demand information is revealed, the firm is allowed to cancel some of the original capacity reservation at a certain fee or sell off some inventory at a lower price. The problem can be viewed as a generalization of the classic newsvendor problem and can be found in many applications. One key observation of the analysis is that the dynamic programming formulation of the problem is closely related to a recursion that arises in the study of a far more complex system, a series inventory system with stochastic demand over an infinite horizon. Using this equivalence, we characterize the optimal policy and assess the value of the additional demand information. We also extend the analysis to a richer model of information. Here, demand is driven by an underlying Markov process, representing economic conditions, weather, market competition, and other environmental factors. Interestingly, under this more general model, the connection to the series inventory system is different. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 2012 相似文献
303.
仿真克隆可以提高并行离散事件仿真的效率和并行性,方便快捷地对仿真中的多种可能性进行分析、比较和评估.给出广义多方案分析仿真概念,介绍仿真克隆的相关概念,分析当前仿真克隆方法的不足,提出提高广义多方案分析仿真整体运行效率的异地克隆概念.基于检查点与恢复方法,在动态并行仿真引擎中实现了异地克隆.利用Phold测试程序对异地克隆方法的效率进行测试,测试结果表明,异地克隆可以提高多方案分析仿真系统整体运行效率. 相似文献
304.
305.
双二体模型是求解地月转移轨道的重要基础。与传统的采用月球影响球入口点经纬度的描述方式不同,本文提出一种基于飞行轨道面参数来描述地月转移轨道的双二体模型几何表达方式,结合一维非线性方程求根算法Brent算法和Lambert原理,将原始三维球面搜索算法降维成为二维圆上的搜索算法,可以高效求解地月转移轨道的形状参数。为避免重复计算,将转移轨道窗口计算的轨道多变量搜索问题解耦分解成两个子问题——转移轨道形状参数求解问题和转移轨道面空间定向问题,降低了问题的求解维度。形成两级并行计算算法,充分发挥多核计算机算力,加速计算过程。仿真结果表明,基于提出的并行圆锥曲线几何切面法,可以成功应用于计算天梯地月转移轨道分析。 相似文献
306.
We introduce a generalized orienteering problem (OP) where, as usual, a vehicle is routed from a prescribed start node, through a directed network, to a prescribed destination node, collecting rewards at each node visited, to maximize the total reward along the path. In our generalization, transit on arcs in the network and reward collection at nodes both consume a variable amount of the same limited resource. We exploit this resource trade‐off through a specialized branch‐and‐bound algorithm that relies on partial path relaxation problems that often yield tight bounds and lead to substantial pruning in the enumeration tree. We present the smuggler search problem (SSP) as an important real‐world application of our generalized OP. Numerical results show that our algorithm applied to the SSP outperforms standard mixed‐integer nonlinear programming solvers for moderate to large problem instances. We demonstrate model enhancements that allow practitioners to represent realistic search planning scenarios by accounting for multiple heterogeneous searchers and complex smuggler motion. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
307.
针对平流层飞艇一般采用多控制机构的特点,提出了将广义逆控制分配方法应用到飞艇姿态控制系统中,并根据飞艇控制机构特性采用了加权伪逆控制分配算法。飞艇姿态控制仿真结果表明:设计的控制分配方法可以有效实现多控制机构的协调操纵,姿态角控制效果良好,避免了单一操纵舵面过早进入饱和状态的情况;合理调整控制分配权值可减少能量损耗,实时性较好,便于工程实现。 相似文献
308.
309.
310.
吴立强 《武警工程学院学报》2014,(6):42-46
目前现存的R—LWE公钥加密方案,普遍存在公钥尺寸大、密文扩展率高的缺陷。给出一种高效的理想格上公钥加密方案,在多用户环境中,借助一个基于广义背包难题的可抵抗碰撞的哈希函数构造用户的公私钥对,缩短了公钥长度;通过增加整个密文中携带消息密文的份额,有效降低了加密每比特明文的平均开销。在安全性方面,由公钥恢复私钥的困难性可以归约到理想格中SVP问题,对密文的攻击相当于求解判定性R—LWE问题。因此,方案能够达到CPA安全性。 相似文献