全文获取类型
收费全文 | 473篇 |
免费 | 97篇 |
国内免费 | 30篇 |
出版年
2023年 | 3篇 |
2022年 | 10篇 |
2021年 | 27篇 |
2020年 | 12篇 |
2019年 | 1篇 |
2018年 | 9篇 |
2017年 | 15篇 |
2016年 | 7篇 |
2015年 | 13篇 |
2014年 | 10篇 |
2013年 | 19篇 |
2012年 | 19篇 |
2011年 | 30篇 |
2010年 | 27篇 |
2009年 | 40篇 |
2008年 | 47篇 |
2007年 | 35篇 |
2006年 | 26篇 |
2005年 | 22篇 |
2004年 | 11篇 |
2003年 | 4篇 |
2002年 | 6篇 |
2001年 | 9篇 |
2000年 | 21篇 |
1999年 | 34篇 |
1998年 | 18篇 |
1997年 | 21篇 |
1996年 | 24篇 |
1995年 | 12篇 |
1994年 | 16篇 |
1993年 | 14篇 |
1992年 | 9篇 |
1991年 | 6篇 |
1990年 | 8篇 |
1989年 | 4篇 |
1988年 | 3篇 |
1987年 | 1篇 |
1986年 | 3篇 |
1985年 | 1篇 |
1983年 | 2篇 |
1982年 | 1篇 |
排序方式: 共有600条查询结果,搜索用时 515 毫秒
91.
92.
We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
93.
This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
94.
95.
96.
97.
以高超声速飞行器为研究对象,构建快速准确计算高超声速飞行器无黏边界层外缘参数的计算方法。拟合空气比热、比热比随温度变化曲线,建立空气属性温度划分准则。基于不同空气属性建立高超声速飞行器边界层外缘参数工程与数值计算模型,采用钝双锥模型,对比分析工程估算、无黏数值及有黏数值计算方法的计算结果。结果表明,0°攻角状态下,基于无黏流场的数值计算与工程估算和有黏数值计算的压强最大差值分别为1.19%和2.39%;10°攻角状态下,最大差值分别为5%和50%;从而证明所提出的无黏数值计算方法明显优于工程计算方法,为进一步快速准确计算高超声速飞行器气动热环境奠定了重要基础。 相似文献
98.
99.
100.