全文获取类型
收费全文 | 472篇 |
免费 | 208篇 |
国内免费 | 40篇 |
出版年
2023年 | 4篇 |
2022年 | 5篇 |
2021年 | 4篇 |
2020年 | 10篇 |
2019年 | 8篇 |
2018年 | 2篇 |
2017年 | 34篇 |
2016年 | 42篇 |
2015年 | 40篇 |
2014年 | 45篇 |
2013年 | 55篇 |
2012年 | 30篇 |
2011年 | 35篇 |
2010年 | 28篇 |
2009年 | 38篇 |
2008年 | 27篇 |
2007年 | 41篇 |
2006年 | 42篇 |
2005年 | 32篇 |
2004年 | 30篇 |
2003年 | 17篇 |
2002年 | 16篇 |
2001年 | 26篇 |
2000年 | 17篇 |
1999年 | 12篇 |
1998年 | 14篇 |
1997年 | 9篇 |
1996年 | 9篇 |
1995年 | 4篇 |
1994年 | 7篇 |
1993年 | 11篇 |
1992年 | 4篇 |
1991年 | 6篇 |
1990年 | 10篇 |
1989年 | 3篇 |
1988年 | 2篇 |
1975年 | 1篇 |
排序方式: 共有720条查询结果,搜索用时 15 毫秒
241.
242.
This study addresses the design of a three‐stage production/distribution system where the first stage includes the set of established retailers and the second and third stages include the sets of potential distribution centers (DCs) and potential capacitated suppliers, respectively. In this problem, in addition to the fixed location/operating costs associated with locating DCs and suppliers, we consider the coordinated inventory replenishment decisions at the located DCs and retailers along with the appropriate inventory costs explicitly. In particular, we account for the replenishment and holding costs at the retailers and selected DCs, and the fixed plus distance‐based transportation costs between the selected plants and their assigned DCs, and between the selected DCs and their respective retailers, explicitly. The resulting formulation is a challenging mixed‐integer nonlinear programming model for which we propose efficient heuristic solution approaches. Our computational results demonstrate the performance of the heuristic approaches as well as the value of integrated decision‐making by verifying that significant cost savings are realizable when the inventory decisions and costs are incorporated in the production distribution system design. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 172–195, 2012 相似文献
243.
244.
针对GNSS导航信号模拟源中多星座轨道计算实时性问题,从计算效率、精度等角度分析和对比了牛顿多项式和埃尔米特多项式插值算法的性能,通过对牛顿插值的加“窗”改进,使得卫星位置、速度的插值精度显著提高.算例结果表明,该方法能够在等间距时间点上多个卫星位置已知、速度未知的条件下,高精度实时地内插出卫星的位置和速度,其中卫星位置插值精度为mm级,速度插值精度小于1e-5 m/s,计算量为广播星历直接计算的1/7,位置和速度的拟合精度均优于三阶埃尔米特插值结果. 相似文献
245.
系统模型误差是导致卡尔曼滤波发散的一个很重要的原因,分析了衰减记忆法和限定记忆法两种对模型误差所致滤波发散的补偿方法,通过引入阈值可以将这两种方法进行有机结合,给出了一种新的衰减限定记忆算法。算例分析验证了衰减限定记忆算法在抑制滤波发散方面具有比衰减记忆和限定记忆法更好的性能,并能自适应调整算法所需观测数据数目。 相似文献
246.
247.
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 相似文献
248.
Stochastic dynamic programming models are attractive for multireservoir control problems because they allow non‐linear features to be incorporated and changes in hydrological conditions to be modeled as Markov processes. However, with the exception of the simplest cases, these models are computationally intractable because of the high dimension of the state and action spaces involved. This paper proposes a new method of determining an operating policy for a multireservoir control problem that uses stochastic dynamic programming, but is practical for systems with many reservoirs. Decomposition is first used to reduce the problem to a number of independent subproblems. Each subproblem is formulated as a low‐dimensional stochastic dynamic program and solved to determine the operating policy for one of the reservoirs in the system. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
249.
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 相似文献
250.