全文获取类型
收费全文 | 134篇 |
免费 | 69篇 |
国内免费 | 4篇 |
出版年
2023年 | 3篇 |
2022年 | 3篇 |
2021年 | 2篇 |
2020年 | 2篇 |
2019年 | 5篇 |
2018年 | 2篇 |
2017年 | 16篇 |
2016年 | 11篇 |
2015年 | 7篇 |
2014年 | 6篇 |
2013年 | 19篇 |
2012年 | 10篇 |
2011年 | 12篇 |
2010年 | 9篇 |
2009年 | 11篇 |
2008年 | 6篇 |
2007年 | 10篇 |
2006年 | 11篇 |
2005年 | 7篇 |
2004年 | 7篇 |
2003年 | 8篇 |
2002年 | 12篇 |
2001年 | 11篇 |
2000年 | 5篇 |
1999年 | 2篇 |
1998年 | 2篇 |
1997年 | 2篇 |
1996年 | 3篇 |
1992年 | 2篇 |
1989年 | 1篇 |
排序方式: 共有207条查询结果,搜索用时 46 毫秒
81.
We consider an expansion planning problem for Waste‐to‐Energy (WtE) systems facing uncertainty in future waste supplies. The WtE expansion plans are regarded as strategic, long term decisions, while the waste distribution and treatment are medium to short term operational decisions which can adapt to the actual waste collected. We propose a prediction set uncertainty model which integrates a set of waste generation forecasts and is constructed based on user‐specified levels of forecasting errors. Next, we use the prediction sets for WtE expansion scenario analysis. More specifically, for a given WtE expansion plan, the guaranteed net present value (NPV) is evaluated by computing an extreme value forecast trajectory of future waste generation from the prediction set that minimizes the maximum NPV of the WtE project. This problem is essentially a multiple stage min‐max dynamic optimization problem. By exploiting the structure of the WtE problem, we show this is equivalent to a simpler min‐max optimization problem, which can be further transformed into a single mixed‐integer linear program. Furthermore, we extend the model to optimize the guaranteed NPV by searching over the set of all feasible expansion scenarios, and show that this can be solved by an exact cutting plane approach. We also propose a heuristic based on a constant proportion distribution rule for the WtE expansion optimization model, which reduces the problem into a moderate size mixed‐integer program. Finally, our computational studies demonstrate that our proposed expansion model solutions are very stable and competitive in performance compared to scenario tree approaches. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 47–70, 2016 相似文献
82.
针对GPS实时动态精密相对定位应用背景,提出一种整周模糊度实时求解方法。采用宽巷组合载波相位双差、伪距双差观测信息建立观测模型;对浮点模糊度协方差阵进行一次Cholesky分解,构造了浮点转换矩阵,使浮点模糊度完全去相关;推导确定整周模糊度的搜索空间;利用最小残差平方和搜索准则,确定单历元整周模糊度,并用OVT检验方法,对不同历元得到的整周模糊度进行一致性检验。结果表明,观测量误差均方差取值对整周模糊度搜索空间和成功率有较大影响,附加OVT检验的双频去相关单历元动态解算整周模糊度方法正确可行。 相似文献
83.
84.
This article considers the order batching problem in steelmaking and continuous‐casting production. The problem is to jointly specify the slabs needed to satisfy each customer order and group all the slabs of different customer orders into production batches. A novel mixed integer programming model is formulated for the problem. Through relaxing the order assignment constraints, a Lagrangian relaxation model is then obtained. By exploiting the relationship between Lagrangian relaxation and column generation, we develop a combined algorithm that contains nested double loops. At the inner loop, the subgradient method is applied for approximating the Lagrangian dual problem and pricing out columns of the master problem corresponding to the linear dual form of the Lagrangian dual problem. At the outer loop, column generation is employed to solve the master problem exactly and adjust Lagrangian multipliers. Computational experiments are carried out using real data collected from a large steel company, as well as on large‐scaled problem instances randomly generated. The results demonstrate that the combined algorithm can obtain tighter lower bound and higher quality solution within an acceptable computation time as compared to the conventional Lagrangian relaxation algorithm. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
85.
提出了一种在球坐标系下的无源时差定位算法,该算法解决了参变量法中难于解决的模糊和无解问题,计算量小,定位结果可信。当布站接近平面时,本算法可独立进行定位,当站址高度差较大时本算法可以与参变量法相配合解决模糊和无解问题,适合于工程应用。 相似文献
86.
87.
In this paper, we study the problem of scheduling quay cranes (QCs) at container terminals where incoming vessels have different ready times. The objective is to minimize the maximum relative tardiness of vessel departures. The problem can be formulated as a mixed integer linear programming (MILP) model of large size that is difficult to solve directly. We propose a heuristic decomposition approach to breakdown the problem into two smaller, linked models, the vessel‐level and the berth‐level models. With the same berth‐level model, two heuristic methods are developed using different vessel‐level models. Computational experiments show that the proposed approach is effective and efficient. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
88.
对影响叶簇穿透超宽带SAR系统性能的三个最主要的技术参量 (工作频率、极化形式和分辨率 )进行了深入系统的分析 ,其结论性意见对超宽带雷达系统顶层设计有实用参考价值 相似文献
89.
歧义容忍度图式理论与英语听力教学 总被引:2,自引:0,他引:2
杜志梅 《中国人民武装警察部队学院学报》2006,22(3):43-45
"听"是语言交流的基础.当前,由于受传统教学模式的影响,学生的英语听说能力不强.提高学生的歧义容忍度,有效运用图式理论,强化阅读理解能力等教学方法是提高学生听力的有效途径. 相似文献
90.