全文获取类型
收费全文 | 562篇 |
免费 | 218篇 |
国内免费 | 40篇 |
出版年
2024年 | 4篇 |
2023年 | 10篇 |
2022年 | 13篇 |
2021年 | 10篇 |
2020年 | 21篇 |
2019年 | 19篇 |
2018年 | 12篇 |
2017年 | 38篇 |
2016年 | 49篇 |
2015年 | 30篇 |
2014年 | 58篇 |
2013年 | 32篇 |
2012年 | 58篇 |
2011年 | 54篇 |
2010年 | 38篇 |
2009年 | 52篇 |
2008年 | 37篇 |
2007年 | 43篇 |
2006年 | 57篇 |
2005年 | 34篇 |
2004年 | 27篇 |
2003年 | 16篇 |
2002年 | 20篇 |
2001年 | 15篇 |
2000年 | 11篇 |
1999年 | 13篇 |
1998年 | 10篇 |
1997年 | 5篇 |
1996年 | 5篇 |
1995年 | 5篇 |
1994年 | 4篇 |
1993年 | 4篇 |
1992年 | 3篇 |
1991年 | 4篇 |
1990年 | 4篇 |
1989年 | 5篇 |
排序方式: 共有820条查询结果,搜索用时 453 毫秒
681.
This article analyzes a capacity/inventory planning problem with a one‐time uncertain demand. There is a long procurement leadtime, but as some partial demand information is revealed, the firm is allowed to cancel some of the original capacity reservation at a certain fee or sell off some inventory at a lower price. The problem can be viewed as a generalization of the classic newsvendor problem and can be found in many applications. One key observation of the analysis is that the dynamic programming formulation of the problem is closely related to a recursion that arises in the study of a far more complex system, a series inventory system with stochastic demand over an infinite horizon. Using this equivalence, we characterize the optimal policy and assess the value of the additional demand information. We also extend the analysis to a richer model of information. Here, demand is driven by an underlying Markov process, representing economic conditions, weather, market competition, and other environmental factors. Interestingly, under this more general model, the connection to the series inventory system is different. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 2012 相似文献
682.
We present two frameworks for designing random search methods for discrete simulation optimization. One of our frameworks is very broad (in that it includes many random search methods), whereas the other one considers a special class of random search methods called point‐based methods, that move iteratively between points within the feasible region. Our frameworks involve averaging, in that all decisions that require estimates of the objective function values at various feasible solutions are based on the averages of all observations collected at these solutions so far. Also, the methods are adaptive in that they can use information gathered in previous iterations to decide how simulation effort is expended in the current iteration. We show that the methods within our frameworks are almost surely globally convergent under mild conditions. Thus, the generality of our frameworks and associated convergence guarantees makes the frameworks useful to algorithm developers wishing to design efficient and rigorous procedures for simulation optimization. We also present two variants of the simulated annealing (SA) algorithm and provide their convergence analysis as example application of our point‐based framework. Finally, we provide numerical results that demonstrate the empirical effectiveness of averaging and adaptivity in the context of SA. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
683.
We consider a setting in which inventory plays both promotional and service roles; that is, higher inventories not only improve service levels but also stimulate demand by serving as a promotional tool (e.g., as the result of advertising effect by the enhanced product visibility). Specifically, we study the periodic‐review inventory systems in which the demand in each period is uncertain but increases with the inventory level. We investigate the multiperiod model with normal and expediting orders in each period, that is, any shortage will be met through emergency replenishment. Such a model takes the lost sales model as a special case. For the cases without and with fixed order costs, the optimal inventory replenishment policy is shown to be of the base‐stock type and of the (s,S) type, respectively. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
684.
This article studies the classical single‐item economic lot‐sizing problem with constant capacities, fixed‐plus‐linear order costs, and concave inventory costs, where backlogging is allowed. We propose an O(T3) optimal algorithm for the problem, which improves upon the O(T4) running time of the famous algorithm developed by Florian and Klein (Manage Sci18 (1971) 12–20). Instead of using the standard dynamic programming approach by predetermining the minimal cost for every possible subplan, we develop a backward dynamic programming algorithm to obtain a more efficient implementation. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
685.
针对传统结构动力学优化过程中求解效率较低的问题,以环形桁架可展天线结构参数优化为研究背景,在环形桁架可展天线结构的参数变量空间中,以试验设计方法选取样本点,通过有限元方法得到各个样本点的第一阶固有频率、固定载荷最大变形等响应值,利用样本点和响应值的关系建立Kriging近似模型进行优化算法的寻优,得到满足所有约束条件的最优解。结果表明,所得到的环形桁架可展天线第一阶固有频率、固定载荷最大变形的响应面呈现比较明显的非线性关系,基于Kriging模型的结构优化方法能比较准确地对环形桁架可展天线进行寻优设计。 相似文献
686.
687.
688.
以多爆炸成型弹丸(MEFP)为计算模型,应用显式有限元程序LS-DYNA,分析了药型罩间距、锥角、壁厚、装药高度和装药直径5种因素对MEFP发散角的影响规律。结果表明:随着药型罩间距、壁厚和装药直径的增加以及药型罩锥角、装药高度的减小,MEFP的发散角在减小。在此基础上以MEFP发散角为命中和毁伤概率指标,应用正交优化方法针对5种结构因素对MEFP发散角的影响主次关系进行了分析研究。结果表明药型罩壁厚是MEFP战斗部命中和毁伤概率的主要影响因素,并得到了5种结构因素各水平的最优组合。 相似文献
689.
690.
Leo J. Blanken 《Defense & Security Analysis》2012,28(4):326-342
The authors engage in the debate over waste in military force structure planning by rigorously deconstructing the concept of “redundancy.” First, a typology of redundancy is constructed that provides a common framework for identifying variety among redundant structures. These are labeled “true redundancy,” “expanded capacity,” “portfolio diversification,” and “mission overlap.” Further, a number of mechanisms are identified that produce these types of structures, and show the conditions under which planners may utilize redundant structure in the search for optimization. In sum, the article provides refined concepts for analysts and planners to identify when redundancy is deleterious or beneficial. 相似文献