全文获取类型
收费全文 | 463篇 |
免费 | 149篇 |
国内免费 | 28篇 |
出版年
2024年 | 2篇 |
2023年 | 1篇 |
2022年 | 4篇 |
2021年 | 14篇 |
2020年 | 10篇 |
2019年 | 9篇 |
2018年 | 6篇 |
2017年 | 20篇 |
2016年 | 27篇 |
2015年 | 19篇 |
2014年 | 33篇 |
2013年 | 38篇 |
2012年 | 29篇 |
2011年 | 40篇 |
2010年 | 23篇 |
2009年 | 40篇 |
2008年 | 43篇 |
2007年 | 42篇 |
2006年 | 28篇 |
2005年 | 35篇 |
2004年 | 24篇 |
2003年 | 18篇 |
2002年 | 24篇 |
2001年 | 17篇 |
2000年 | 10篇 |
1999年 | 13篇 |
1998年 | 15篇 |
1997年 | 10篇 |
1996年 | 5篇 |
1995年 | 2篇 |
1994年 | 5篇 |
1993年 | 6篇 |
1992年 | 2篇 |
1991年 | 5篇 |
1990年 | 19篇 |
1989年 | 2篇 |
排序方式: 共有640条查询结果,搜索用时 0 毫秒
501.
502.
捷联惯导+G/G接收机+星光组合导航应用研究 总被引:3,自引:0,他引:3
提出了适用于高空导弹的以捷联惯导为主,G/G接收机、星光导航为辅的组合导航方式,对组合方式进行了讨论,并给出了捷联惯导+G/G接收机+星光组合导航的原理图。 相似文献
503.
We study a multi‐item capacitated lot‐sizing problem with setup times and pricing (CLSTP) over a finite and discrete planning horizon. In this class of problems, the demand for each independent item in each time period is affected by pricing decisions. The corresponding demands are then satisfied through production in a single capacitated facility or from inventory, and the goal is to set prices and determine a production plan that maximizes total profit. In contrast with many traditional lot‐sizing problems with fixed demands, we cannot, without loss of generality, restrict ourselves to instances without initial inventories, which greatly complicates the analysis of the CLSTP. We develop two alternative Dantzig–Wolfe decomposition formulations of the problem, and propose to solve their relaxations using column generation and the overall problem using branch‐and‐price. The associated pricing problem is studied under both dynamic and static pricing strategies. Through a computational study, we analyze both the efficacy of our algorithms and the benefits of allowing item prices to vary over time. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
504.
We consider a two‐level system in which a warehouse manages the inventories of multiple retailers. Each retailer employs an order‐up‐to level inventory policy over T periods and faces an external demand which is dynamic and known. A retailer's inventory should be raised to its maximum limit when replenished. The problem is to jointly decide on replenishment times and quantities of warehouse and retailers so as to minimize the total costs in the system. Unlike the case in the single level lot‐sizing problem, we cannot assume that the initial inventory will be zero without loss of generality. We propose a strong mixed integer program formulation for the problem with zero and nonzero initial inventories at the warehouse. The strong formulation for the zero initial inventory case has only T binary variables and represents the convex hull of the feasible region of the problem when there is only one retailer. Computational results with a state‐of‐the art solver reveal that our formulations are very effective in solving large‐size instances to optimality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
505.
基于更新过程的多阶段备件需求模型 总被引:2,自引:0,他引:2
正态分布、威布尔分布是常用的备件寿命模型,但是正态分布和威布尔分布的记忆性会导致多阶段需求量预测的相关性.利用更新过程理论,将叠加的更新过程分解和拼接,建立单阶段多项备件需求模型;通过将年龄转移到下个阶段,建立了多阶段不可修备件需求模型;采用加权平均法对多阶段需求模型进行了修正.仿真表明,这种模型能有效预测多阶段需求的波动. 相似文献
506.
We consider the joint pricing and inventory‐control problem for a retailer who orders, stocks, and sells two products. Cross‐price effects exist between the two products, which means that the demand of each product depends on the prices of both products. We derive the optimal pricing and inventory‐control policy and show that this policy differs from the base‐stock list‐price policy, which is optimal for the one‐product problem. We find that the retailer can significantly improve profits by managing the two products jointly as opposed to independently, especially when the cross‐price demand elasticity is high. We also find that the retailer can considerably improve profits by using dynamic pricing as opposed to static pricing, especially when the demand is nonstationary. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
507.
We consider the two‐machine open shop scheduling problem in which the jobs are brought to the system by a single transporter and moved between the processing machines by the same transporter. The purpose is to split the jobs into batches and to find the sequence of moves of the transporter so that the time by which the completed jobs are collected together on board the transporter is minimal. We present a ‐approximation algorithm. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
508.
509.
510.
飞行器INS/SAR组合导航中SAR匹配位置参数作为组合滤波器的输入之前需经过多个传递环节的转换.研究了从地面SAR匹配位置到载体主惯导中心位置所涉及各环节间的相互关系及诸参数在各环节中的传递过程,包括地面SAR匹配位置参数向飞行器上SAR相位中心的传递,SAR相位中心参数向辅助惯导中心的传递以及辅助惯导中心位置参数向主惯导位置中心的传递,以此为基础建立测量参数传递过程数学模型.基于传递模型惯导修正及传递误差分析实验结果与实际相符,验证了参数传递模型的正确性与可行性. 相似文献