全文获取类型
收费全文 | 1166篇 |
免费 | 349篇 |
国内免费 | 69篇 |
出版年
2024年 | 1篇 |
2023年 | 5篇 |
2022年 | 17篇 |
2021年 | 25篇 |
2020年 | 21篇 |
2019年 | 19篇 |
2018年 | 12篇 |
2017年 | 62篇 |
2016年 | 62篇 |
2015年 | 49篇 |
2014年 | 71篇 |
2013年 | 131篇 |
2012年 | 137篇 |
2011年 | 155篇 |
2010年 | 65篇 |
2009年 | 57篇 |
2008年 | 65篇 |
2007年 | 83篇 |
2006年 | 86篇 |
2005年 | 94篇 |
2004年 | 71篇 |
2003年 | 66篇 |
2002年 | 35篇 |
2001年 | 49篇 |
2000年 | 39篇 |
1999年 | 20篇 |
1998年 | 13篇 |
1997年 | 11篇 |
1996年 | 16篇 |
1995年 | 4篇 |
1994年 | 5篇 |
1993年 | 5篇 |
1992年 | 11篇 |
1991年 | 7篇 |
1990年 | 10篇 |
1989年 | 5篇 |
排序方式: 共有1584条查询结果,搜索用时 15 毫秒
951.
In this article, we present a multistage model to optimize inventory control decisions under stochastic demand and continuous review. We first formulate the general problem for continuous stages and use a decomposition solution approach: since it is never optimal to let orders cross, the general problem can be broken into a set of single‐unit subproblems that can be solved in a sequential fashion. These subproblems are optimal control problems for which a differential equation must be solved. This can be done easily by recursively identifying coefficients and performing a line search. The methodology is then extended to a discrete number of stages and allows us to compute the optimal solution in an efficient manner, with a competitive complexity. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 32–46, 2016 相似文献
952.
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 相似文献
953.
Thomas-Durell Young 《战略研究杂志》2016,39(7):936-955
Traditionally, policy and planning have been institutionally weak in the Naval Staff (Office of the Chief of Naval Operations – OPNAV). In their place, the N8 (Programming) has dominated resource decision-making, and, by default, decisions relating to policy and planning. Recent uncertainty over defense authorization and appropriations has resulted in calls for a greater role to be played by the N3/5, Policy and Plans Directorate. The article argues that reform of the Department of the Navy’s planning process is urgently needed. OPNAV’s weak planning and overly dominant programming practices are compared with those of the Departments of the Army and Air Force and are shown to be out of conformance with them. The article concludes with specific and detailed recommendations for reform of both the current planning and programming processes. 相似文献
954.
The probability of the existence of a feasible flow in a stochastic transportation network
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Stochastic transportation networks arise in various real world applications, for which the probability of the existence of a feasible flow is regarded as an important performance measure. Although the necessary and sufficient condition for the existence of a feasible flow represented by an exponential number of inequalities is a well‐known result in the literature, the computation of the probability of all such inequalities being satisfied jointly is a daunting challenge. The state‐of‐the‐art approach of Prékopa and Boros, Operat Res 39 (1991) 119–129 approximates this probability by giving its lower and upper bounds using a two‐part procedure. The first part eliminates all redundant inequalities and the second gives the lower and upper bounds of the probability by solving two well‐defined linear programs with the inputs obtained from the first part. Unfortunately, the first part may still leave many non‐redundant inequalities. In this case, it would be very time consuming to compute the inputs for the second part even for small‐sized networks. In this paper, we first present a model that can be used to eliminate all redundant inequalities and give the corresponding computational results for the same numerical examples used in Prékopa and Boros, Operat Res 39 (1991) 119–129. We also show how to improve the lower and upper bounds of the probability using the multitree and hypermultitree, respectively. Furthermore, we propose an exact solution approach based on the state space decomposition to compute the probability. We derive a feasible state from a state space and then decompose the space into several disjoint subspaces iteratively. The probability is equal to the sum of the probabilities in these subspaces. We use the 8‐node and 15‐node network examples in Prékopa and Boros, Operat Res 39 (1991) 119–129 and the Sioux‐Falls network with 24 nodes to show that the space decomposition algorithm can obtain the exact probability of these classical examples efficiently. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 479–491, 2016 相似文献
955.
基于综合集成赋权法的导弹攻击目标价值分析 总被引:2,自引:0,他引:2
合理选择打击目标是导弹攻击作战中的首要问题,分析了目标价值影响因素,改进了信息熵权法,采用目标偏好的主观赋权法和综合集成赋权法确定因素权重,并结合模糊综合评估的方法对目标价值进行分析排序,给出了算例实现,为解决导弹攻击作战过程的目标价值评估排序问题提供决策依据。 相似文献
956.
957.
958.
分析研究卫星移动通信系统中上行链路波束分集接收的可行性和性能及联合TPC编码性能。分析了波束交叠、波束增益对多波束卫星通信系统的性能影响,建立了用于多波束分集处理的系统模型;引用基于MGF函数的性能分析方法,针对波束分集的研究,得到了Nakagami-m衰落信道条件下的多波束相干最大比合并(MRC)性能;利用计算机仿真验证算法的有效性,并进一步分析了联合Turbo乘积码(TPC)编码的性能。通过研究表明,在多波束卫星通信中采用分集接收处理不仅完全可行,而且可以有效提高上行链路的性能,降低地面终端的发送功率,解决上行链路发送能力不足的问题,联合TPC编码可以获得进一步的性能增益。 相似文献
959.
960.
王晨 《中国人民武装警察部队学院学报》2008,24(8):17-19
利用人工神经网络对地震火灾发生率进行非线性预测具有实用价值和理论意义。分析了人工神经网络预测的优势和不足,并提出算法改进意见,在综合分析人工神经网络预测的工作机理、构造方式以及影响城市居民小区地震火灾发生率的主要因素的基础上,构造人工神经网络模型进行火灾发生率的实例预测,并针对预测结果分析了各影响要素对地震火灾发生率发生影响的强弱程度,非线性预测的结果与预期结果相符。 相似文献