全文获取类型
收费全文 | 1711篇 |
免费 | 739篇 |
国内免费 | 170篇 |
出版年
2024年 | 14篇 |
2023年 | 19篇 |
2022年 | 30篇 |
2021年 | 32篇 |
2020年 | 40篇 |
2019年 | 41篇 |
2018年 | 41篇 |
2017年 | 102篇 |
2016年 | 139篇 |
2015年 | 116篇 |
2014年 | 160篇 |
2013年 | 139篇 |
2012年 | 156篇 |
2011年 | 142篇 |
2010年 | 126篇 |
2009年 | 152篇 |
2008年 | 113篇 |
2007年 | 136篇 |
2006年 | 140篇 |
2005年 | 112篇 |
2004年 | 114篇 |
2003年 | 68篇 |
2002年 | 73篇 |
2001年 | 73篇 |
2000年 | 49篇 |
1999年 | 50篇 |
1998年 | 40篇 |
1997年 | 35篇 |
1996年 | 34篇 |
1995年 | 18篇 |
1994年 | 29篇 |
1993年 | 18篇 |
1992年 | 22篇 |
1991年 | 15篇 |
1990年 | 19篇 |
1989年 | 10篇 |
1988年 | 3篇 |
排序方式: 共有2620条查询结果,搜索用时 15 毫秒
871.
872.
873.
We consider a generalization of the well‐known generalized assignment problem (GAP) over discrete time periods encompassed within a finite planning horizon. The resulting model, MultiGAP, addresses the assignment of tasks to agents within each time period, with the attendant single‐period assignment costs and agent‐capacity constraint requirements, in conjunction with transition costs arising between any two consecutive periods in which a task is reassigned to a different agent. As is the case for its single‐period antecedent, MultiGAP offers a robust tool for modeling a wide range of capacity planning problems occurring within supply chain management. We provide two formulations for MultiGAP and establish that the second (alternative) formulation provides a tighter bound. We define a Lagrangian relaxation‐based heuristic as well as a branch‐and‐bound algorithm for MultiGAP. Computational experience with the heuristic and branch‐and‐bound algorithm on over 2500 test problems is reported. The Lagrangian heuristic consistently generates high‐quality and in many cases near‐optimal solutions. The branch‐and‐bound algorithm is also seen to constitute an effective means for solving to optimality MultiGAP problems of reasonable size. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
874.
要开展凝胶推进剂液滴燃烧特性的实验研究,必须首先形成凝胶推进剂液滴,在毛细管末端形成液滴是常用的液滴生成方法之一。为了揭示毛细管末端凝胶推进剂液滴的形成过程,求解了轴对称坐标系下的N-S方程,采用VOF(volume of fluid)方法捕捉液滴形成过程中气液交界面的演化规律,研究了无量纲液滴颈部直径DN/D0和无量纲液滴高度L/D0随时间的变化规律,并且与实验结果进行比较,验证了数值模型的可靠性。计算结果表明:在液滴形成过程中,液滴不是一直处于稳态;液滴颈部存在较大的剪切率,导致粘度下降,进而加快了颈部的断裂和自由液滴的形成;颈部断裂后,与液滴相连的部分迅速与液滴融合,出现很大的正向速度,而与毛细管末端相连的部分迅速收回,出现很大的负向速度。 相似文献
875.
上海磁浮列车由于流线型车头较短,气动性能并不理想,根据国内厂家给定的列车横断面尺寸和对气动性能的要求,对国产磁浮列车气动外形进行多方案设计,通过求解三维可压N-S方程和k-ε双方程湍流模型,对提出的磁浮列车各种外形方案的气动性能进行数值模拟计算,并根据计算结果进一步改进气动外形,如此反复,直至得出气动性能和外观最优的磁浮列车外形。在最终选定的三种设计方案中,方案3由于水平投影轮廓线较窄、最大纵剖面轮廓线曲率较小,其整车空气阻力和列车交会压力波都较其它两种方案要小,因此为最佳的气动外形方案。通过比较分析,此次选用的国产磁浮列车外形,列车以430km/h运行时三节车总的空气阻力为33.84kN,而上海磁浮列车为54.07kN;国产磁浮列车最大列车交会压力波幅值为2913Pa,而在同等条件下上海磁浮列车为3827Pa,其气动性能明显优于上海磁浮列车。 相似文献
876.
Harold P. Benson 《海军后勤学研究》2006,53(4):309-317
The purpose of this article is to present an algorithm for globally maximizing the ratio of two convex functions f and g over a convex set X. To our knowledge, this is the first algorithm to be proposed for globally solving this problem. The algorithm uses a branch and bound search to guarantee that a global optimal solution is found. While it does not require the functions f and g to be differentiable, it does require that subgradients of g can be calculated efficiently. The main computational effort of the algorithm involves solving a sequence of subproblems that can be solved by convex programming methods. When X is polyhedral, these subproblems can be solved by linear programming procedures. Because of these properties, the algorithm offers a potentially attractive means for globally maximizing ratios of convex functions over convex sets. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
877.
This paper discusses a novel application of mathematical programming techniques to a regression problem. While least squares regression techniques have been used for a long time, it is known that their robustness properties are not desirable. Specifically, the estimators are known to be too sensitive to data contamination. In this paper we examine regressions based on Least‐sum of Absolute Deviations (LAD) and show that the robustness of the estimator can be improved significantly through a judicious choice of weights. The problem of finding optimum weights is formulated as a nonlinear mixed integer program, which is too difficult to solve exactly in general. We demonstrate that our problem is equivalent to a mathematical program with a single functional constraint resembling the knapsack problem and then solve it for a special case. We then generalize this solution to general regression designs. Furthermore, we provide an efficient algorithm to solve the general nonlinear, mixed integer programming problem when the number of predictors is small. We show the efficacy of the weighted LAD estimator using numerical examples. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
878.
879.
任务规划系统研究综述 总被引:4,自引:0,他引:4
任务规划系统作为举世瞩目的高科技技术,已经引起了广泛的关注和应用.目前世界上一些主要国家都在研制任务规划系统,且进展很快.为了更好地推进我国学者对于任务规划系统的研究,对任务规划系统的研究进行了全面综述.主要内容包括任务规划系统的发展、应用、主要实现方法及未来发展方向.在应用中,综述了任务规划系统在战场态势评估、无人飞行器、机器人领域的应用.在主要实现方法中,主要描述了数学规划、D*优化算法、Agent方法和遗传算法四种方法.最后给出了任务规划系统未来发展方向:现代技术的融合、发展战略级任务规划系统及未来社会任务规划系统预研. 相似文献
880.