全文获取类型
收费全文 | 351篇 |
免费 | 165篇 |
国内免费 | 42篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 4篇 |
2021年 | 6篇 |
2020年 | 10篇 |
2019年 | 12篇 |
2018年 | 13篇 |
2017年 | 26篇 |
2016年 | 31篇 |
2015年 | 26篇 |
2014年 | 34篇 |
2013年 | 27篇 |
2012年 | 31篇 |
2011年 | 24篇 |
2010年 | 17篇 |
2009年 | 42篇 |
2008年 | 23篇 |
2007年 | 33篇 |
2006年 | 36篇 |
2005年 | 16篇 |
2004年 | 23篇 |
2003年 | 10篇 |
2002年 | 10篇 |
2001年 | 13篇 |
2000年 | 13篇 |
1999年 | 6篇 |
1998年 | 6篇 |
1997年 | 9篇 |
1996年 | 10篇 |
1995年 | 5篇 |
1994年 | 2篇 |
1993年 | 6篇 |
1992年 | 8篇 |
1991年 | 5篇 |
1990年 | 11篇 |
1989年 | 5篇 |
1988年 | 1篇 |
排序方式: 共有558条查询结果,搜索用时 109 毫秒
51.
信天翁凭借动态滑翔的飞行技巧从梯度风中获取能量,从而在几乎不拍翅膀的情况下进行长时间、长距离飞行,这种技巧应用于小型无人机上可拓展其完成任务的能力。基于飞行器动力学对梯度风场中的无人机运动方程进行推导和简化处理;利用简化的运动方程,分别从非惯性参考系中的动能定理和机械能变化的角度,对动态滑翔获取能量的机理进行分析;利用微分平坦法,以最小平均控制输入变化率为目标函数,对徘徊模式和平移模式的动态滑翔航迹进行优化计算。分析结果表明:逆风爬升、顺风下滑是动态滑翔基本获能方式。优化结果表明:控制输入变得更加平滑,甚至出现阶段性的常值,使得控制更加简化;徘徊模式下,当风梯度作为决策变量时,优化过程可在[0,0.5 s-1]的区间上找到使得目标函数值最小的风梯度;平移模式下,目标函数值在该区间上单调递减。 相似文献
52.
We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
53.
We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
54.
一类线性规划模型的求解方法 总被引:1,自引:0,他引:1
戴明强 《海军工程大学学报》2003,15(4):45-46
应用矩阵理论知识得到了一类特殊的线性规划模型的相关定理,给出了一种简便求解方法,讨论了求解方法的推广问题. 相似文献
55.
56.
57.
Yoshinori Suzuki 《海军后勤学研究》2008,55(8):737-746
Fuel optimizers are decision models (software products) that are increasingly recognized as effective fuel management tools by U.S. truckload carriers. Using the latest price data of every truck stop, these models calculate the optimal fueling schedule for each route that indicates: (i) which truck stop(s) to use, and (ii) how much fuel to buy at the chosen truck stop(s) to minimize the refueling cost. In the current form, however, these models minimize only the fuel cost, and ignore or underestimate other costs that are affected by the models' decision variables. On the basis of the interviews with carrier managers, truck drivers, and fuel‐optimizer vendors, this article proposes a comprehensive model of motor‐carrier fuel optimization that considers all of the costs that are affected by the model's decision variables. Simulation results imply that the proposed model not only attains lower vehicle operating costs than the commercial fuel optimizers, but also gives solutions that are more desirable from the drivers' viewpoint. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
58.
59.
Martijn van Ee 《海军后勤学研究》2020,67(2):147-158
We consider the salvo policy problem, in which there are k moments, called salvos, at which we can fire multiple missiles simultaneously at an incoming object. Each salvo is characterized by a probability pi: the hit probability of a single missile. After each salvo, we can assess whether the incoming object is still active. If it is, we fire the missiles assigned to the next salvo. In the salvo policy problem, the goal is to assign at most n missiles to salvos in order to minimize the expected number of missiles used. We consider three problem versions. In Gould's version, we have to assign all n missiles to salvos. In the Big Bomb version, a cost of B is incurred when all salvo's are unsuccessful. Finally, we consider the Quota version in which the kill probability should exceed some quota Q. We discuss the computational complexity and the approximability of these problem versions. In particular, we show that Gould's version and the Big Bomb version admit pseudopolynomial time exact algorithms and fully polynomial time approximation schemes. We also present an iterative approximation algorithm for the Quota version, and show that a related problem is NP-complete. 相似文献
60.
In networks, there are often more than one sources of capacity. The capacities can be permanently or temporarily owned by the decision maker. Depending on the nature of sources, we identify the permanent capacity, spot market capacity, and contract capacity. We use a scenario tree to model the uncertainty, and build a multi‐stage stochastic integer program that can incorporate multiple sources and multiple types of capacities in a general network. We propose two solution methodologies for the problem. Firstly, we design an asymptotically convergent approximation algorithm. Secondly, we design a cutting plane algorithm based on Benders decomposition to find tight bounds for the problem. The numerical experiments show superb performance of the proposed algorithms compared with commercial software. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 600–614, 2017 相似文献