全文获取类型
收费全文 | 221篇 |
免费 | 88篇 |
国内免费 | 22篇 |
出版年
2024年 | 1篇 |
2023年 | 2篇 |
2022年 | 9篇 |
2021年 | 8篇 |
2020年 | 5篇 |
2018年 | 1篇 |
2017年 | 18篇 |
2016年 | 17篇 |
2015年 | 18篇 |
2014年 | 12篇 |
2013年 | 10篇 |
2012年 | 17篇 |
2011年 | 24篇 |
2010年 | 18篇 |
2009年 | 24篇 |
2008年 | 18篇 |
2007年 | 23篇 |
2006年 | 16篇 |
2005年 | 10篇 |
2004年 | 6篇 |
2003年 | 4篇 |
2002年 | 10篇 |
2001年 | 9篇 |
2000年 | 9篇 |
1999年 | 12篇 |
1998年 | 6篇 |
1997年 | 7篇 |
1996年 | 4篇 |
1995年 | 3篇 |
1994年 | 3篇 |
1993年 | 2篇 |
1992年 | 1篇 |
1990年 | 2篇 |
1988年 | 2篇 |
排序方式: 共有331条查询结果,搜索用时 15 毫秒
101.
102.
在综合评判驱逐舰目标毁伤等级并建立目标毁伤树的基础上,构造了舰炮武器系统对驱逐舰目标射击命中毁伤区域的简化模型图,建立了舰炮对驱逐舰目标射击的条件命中概率模型,通过分析弹丸对装甲目标的终点效应,建立了舰炮对驱逐舰目标射击的条件毁伤概率模型.计算结果表明,运用该方法研究舰炮武器系统对驱逐舰目标射击毁伤定律可信性高. 相似文献
103.
在全面分析杀爆弹对主战坦克毁伤效应的基础上,针对冲击波和破片对坦克外部件的毁伤,利用计算机仿真方法进行杀爆弹对主战坦克毁伤评估。利用射击线技术构建了杀爆弹对主战坦克毁伤评估模型;基于蒙特卡洛随机模拟试验法,开发了计算程序,进行了以破片杀伤为主的杀爆弹对主战坦克毁伤效应仿真评估,得到了车体命中破片数随炸点坐标变化规律,以及坦克整体毁伤概率随杀爆弹终点速度变化规律。研究结果为主战坦克目标易损性分析与毁伤评估提供了重要参考。 相似文献
104.
Michael C. Fu 《海军后勤学研究》2008,55(8):723-736
Derivatives (or gradients) are important for both sensitivity analysis and optimization, and in simulation models, these can often be estimated efficiently using various methods other than brute‐force finite differences. This article briefly summarizes the main approaches and discusses areas in which the approaches can most fruitfully be applied: queueing, inventory, and finance. In finance, the focus is on derivatives of another sort. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
105.
106.
We consider a reliable network design problem under uncertain edge failures. Our goal is to select a minimum‐cost subset of edges in the network to connect multiple terminals together with high probability. This problem can be seen as a stochastic variant of the Steiner tree problem. We propose two scenario‐based Steiner cut formulations, study the strength of the proposed valid inequalities, and develop a branch‐and‐cut solution method. We also propose an LP‐based separation for the scenario‐based directed Steiner cut inequalities using Benders feasibility cuts, leveraging the success of the directed Steiner cuts for the deterministic Steiner tree problem. In our computational study, we test our branch‐and‐cut method on instances adapted from graphs in SteinLib Testdata Library with up to 100 nodes, 200 edges, and 17 terminals. The performance of our branch‐and‐cut method demonstrates the strength of the scenario‐based formulations and the benefit from adding the additional valid inequalities that we propose. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 321–334, 2015 相似文献
107.
Modeling and solution for the ship stowage planning problem of coils in the steel industry 下载免费PDF全文
We consider a ship stowage planning problem where steel coils with known destination ports are to be loaded onto a ship. The coils are to be stowed on the ship in rows. Due to their heavy weight and cylindrical shape, coils can be stowed in at most two levels. Different from stowage problems in previous studies, in this problem there are no fixed positions on the ship for the coils due to their different sizes. At a destination port, if a coil to be unloaded is not at a top position, those blocking it need to be shuffled. In addition, the stability of ship has to be maintained after unloading at each destination port. The objective for the stowage planning problem is to minimize a combination of ship instability throughout the entire voyage, the shuffles needed for unloading at the destination ports, and the dispersion of coils to be unloaded at the same destination port. We formulate the problem as a novel mixed integer linear programming model. Several valid inequalities are derived to help reducing solution time. A tabu search (TS) algorithm is developed for the problem with the initial solution generated using a construction heuristic. To evaluate the proposed TS algorithm, numerical experiments are carried out on problem instances of three different scales by comparing it with a model‐based decomposition heuristic, the classic TS algorithm, the particle swarm optimization algorithm, and the manual method used in practice. The results show that for small problems, the proposed algorithm can generate optimal solutions. For medium and large practical problems, the proposed algorithm outperforms other methods. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 564–581, 2015 相似文献
108.
109.
110.