全文获取类型
收费全文 | 353篇 |
免费 | 177篇 |
国内免费 | 27篇 |
出版年
2024年 | 3篇 |
2023年 | 6篇 |
2022年 | 5篇 |
2021年 | 4篇 |
2020年 | 13篇 |
2019年 | 7篇 |
2018年 | 7篇 |
2017年 | 20篇 |
2016年 | 32篇 |
2015年 | 26篇 |
2014年 | 33篇 |
2013年 | 26篇 |
2012年 | 22篇 |
2011年 | 20篇 |
2010年 | 18篇 |
2009年 | 34篇 |
2008年 | 27篇 |
2007年 | 27篇 |
2006年 | 40篇 |
2005年 | 26篇 |
2004年 | 23篇 |
2003年 | 16篇 |
2002年 | 13篇 |
2001年 | 20篇 |
2000年 | 13篇 |
1999年 | 10篇 |
1998年 | 9篇 |
1997年 | 10篇 |
1996年 | 8篇 |
1995年 | 5篇 |
1994年 | 2篇 |
1993年 | 6篇 |
1992年 | 7篇 |
1991年 | 6篇 |
1990年 | 9篇 |
1989年 | 3篇 |
1988年 | 1篇 |
排序方式: 共有557条查询结果,搜索用时 31 毫秒
521.
讨论了一类含脉冲的时滞抛物型方程组非零解的振动性,利用了Green定理以及Jensen不等式,得出了该方程在Robin边界条件下非零解振动的若干准则。 相似文献
522.
Characteristically, a small subset of operational problems admit risk neutrality when contingent claims methodology were used in their analysis. That is, for the majority of manufacturing and production problems, operating cash flows are not directly linked to prices of traded assets. However, to the extent that correlations can be estimated, the methodology's applicability to a broader set of operational problems is supported. Our article addresses this issue with the objective of extending the use of contingent claims techniques to a larger set of operational problems. In broad terms, this objective entails a partial equilibrium approach to the problem of valuing uncertain cash flows. To this end, we assume risk aversion and cast our approach within Merton's intertemporal capital asset pricing model. In this context, we formulate a “generic” production valuation model that is framed as an exercise in stochastic optimal control. The model is versatile in its characterization and can easily be adapted to accommodate a wide‐ranging set of risk‐based operational problems where the underlying sources of uncertainty are not traded. To obtain results, the model is recast as a stochastic dynamic program to be solved numerically. The article addresses a number of fundamental issues in the analysis risk based decision problems in operations. First, in the approach provided, decisions are analyzed under a properly defined risk structure. Second, the process of analysis leads to suitably adjusted probability distributions through which, appropriately discounted expectations are derived. Third, through consolidating existing concepts into a standard and adaptable framework, we extend the applicability of contingent claims methodology to a broader set of operational problems. The approach is advantageous as it obviates the need for exogenously specifying utility functions or discount rates.© 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
523.
Irina S. Dolinskaya 《海军后勤学研究》2012,59(5):325-339
This article examines optimal path finding problems where cost function and constraints are direction, location, and time dependent. Recent advancements in sensor and data‐processing technology facilitate the collection of detailed real‐time information about the environment surrounding a ground vehicle, an airplane, or a naval vessel. We present a navigation model that makes use of such information. We relax a number of assumptions from existing literature on path‐finding problems and create an accurate, yet tractable, model suitable for implementation for a large class of problems. We present a dynamic programming model which integrates our earlier results for direction‐dependent, time and space homogeneous environment, and consequently, improves its accuracy, efficiency, and run‐time. The proposed path finding model also addresses limited information about the surrounding environment, control‐feasibility of the considered paths, such as sharpest feasible turns a vehicle can make, and computational demands of a time‐dependent environment. To demonstrate the applicability and performance of our path‐finding algorithm, computational experiments for a short‐range ship routing in dynamic wave‐field problem are presented. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
524.
In this article, we study item shuffling (IS) problems arising in the logistics system of steel production. An IS problem here is to optimize shuffling operations needed in retrieving a sequence of steel items from a warehouse served by a crane. There are two types of such problems, plate shuffling problems (PSP) and coil shuffling problems (CSP), considering the item shapes. The PSP is modeled as a container storage location assignment problem. For CSP, a novel linear integer programming model is formulated considering the practical stacking and shuffling features. Several valid inequalities are constructed to accelerate the solving of the models. Some properties of optimal solutions of PSP and CSP are also derived. Because of the strong NP‐hardness of the problems, we consider some special cases of them and propose polynomial time algorithms to obtain optimal solutions for these cases. A greedy heuristic is proposed to solve the general problems and its worst‐case performances on both PSP and CSP are analyzed. A tabu search (TS) method with a tabu list of variable length is proposed to further improve the heuristic solutions. Without considering the crane traveling distance, we then construct a rolling variable horizon heuristic for the problems. Numerical experiments show that the proposed heuristic algorithms and the TS method are effective. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
525.
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 相似文献
526.
527.
We introduce an optimal stopping problem for selling an asset when the fixed but unknown distribution of successive offers is from one of n possible distributions. The initial probabilities as to which is the true distribution are given and updated in a Bayesian manner as the successive offers are observed. After receiving an offer, the seller has to decide whether to accept the offer or continue to observe the next offer. Each time an offer is observed a fixed cost is incurred. We consider both the cases where recalling a past offer is allowed and where it is not allowed. For each case, a dynamic programming model and some heuristic policies are presented. Using simulation, the performances of the heuristic methods are evaluated and upper bounds on the optimal expected return are obtained. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
528.
We introduce a generalized orienteering problem (OP) where, as usual, a vehicle is routed from a prescribed start node, through a directed network, to a prescribed destination node, collecting rewards at each node visited, to maximize the total reward along the path. In our generalization, transit on arcs in the network and reward collection at nodes both consume a variable amount of the same limited resource. We exploit this resource trade‐off through a specialized branch‐and‐bound algorithm that relies on partial path relaxation problems that often yield tight bounds and lead to substantial pruning in the enumeration tree. We present the smuggler search problem (SSP) as an important real‐world application of our generalized OP. Numerical results show that our algorithm applied to the SSP outperforms standard mixed‐integer nonlinear programming solvers for moderate to large problem instances. We demonstrate model enhancements that allow practitioners to represent realistic search planning scenarios by accounting for multiple heterogeneous searchers and complex smuggler motion. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
529.
提出了一种小卫星姿态确定的非线性滤波算法,该算法利用三轴磁强计和光纤陀螺作为姿态敏感器。在非线性滤波器的设计中,从两个方面对平方根sigma点卡尔曼滤波方法进行改进。第一,把姿态四元数的矢量部分、光纤陀螺的漂移和噪声组合,得到滤波器的增广状态向量;第二,分别建立向量旋转模型、最优化模型和误差四元数乘法模型来确保非线性滤波过程中四元数的归一化约束。仿真分析结果表明,本文提出的非线性滤波算法能够有效地提高小卫星的定姿性能,与扩展卡尔曼滤波相比,具有较高的精度、稳定性和较快的收敛速度;与无迹卡尔曼滤波相比,收敛性相当,但是精度略优,稳定性和计算效率较高。 相似文献
530.
针对功率放大器的非线性特性及记忆效应,提出了一种基于记忆有理函数的功放行为模型。在传统记忆多项式模型和无记忆有理函数模型基础上,构建记忆有理函数模型,并利用共轭梯度法辨识模型系数,同时比较不同记忆深度和不同非线性阶数下的归一化均方误差,获取最佳记忆深度和非线性阶数。采用多载波的WCDMA信号和MRF6S21140H功放来验证模型的有效性,并与记忆多项式模型、无记忆有理函数模型进行了比较。结果表明,记忆有理函数模型在减少系数数目的同时具有更好的逼近精度。 相似文献