全文获取类型
收费全文 | 332篇 |
免费 | 121篇 |
国内免费 | 9篇 |
出版年
2023年 | 2篇 |
2022年 | 2篇 |
2021年 | 7篇 |
2020年 | 15篇 |
2019年 | 11篇 |
2018年 | 6篇 |
2017年 | 16篇 |
2016年 | 23篇 |
2015年 | 22篇 |
2014年 | 24篇 |
2013年 | 17篇 |
2012年 | 27篇 |
2011年 | 38篇 |
2010年 | 12篇 |
2009年 | 25篇 |
2008年 | 19篇 |
2007年 | 19篇 |
2006年 | 30篇 |
2005年 | 28篇 |
2004年 | 20篇 |
2003年 | 13篇 |
2002年 | 13篇 |
2001年 | 16篇 |
2000年 | 16篇 |
1999年 | 13篇 |
1998年 | 16篇 |
1997年 | 3篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1993年 | 3篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 1篇 |
排序方式: 共有462条查询结果,搜索用时 265 毫秒
401.
通过分析航天测控调度问题的测控需求,建立了航天测控调度0-1整数规划模型,运用拉格朗日松弛方法对模型中的设备约束和卫星约束进行了松弛,运用次梯度优化算法求得了拉格朗日对偶问题的上界.最后,通过对两个场景的试验分析,证明了运用次梯度优化算法求得的上界的有效性. 相似文献
402.
雷达对地面目标的搜索效能是直升机对地作战效能评估的基础,建立雷达对地面目标搜索的数学模型,并分析几个因素对发现目标概率的影响,以及提高目标发现概率的方法,进而提高直升机的作战效能.模型有效地提高了雷达探测地面目标效能评估的准确性,对于指挥决策部门和设计单位有一定的参考意义. 相似文献
403.
404.
Sven Axsäter 《海军后勤学研究》2007,54(5):485-491
A two‐echelon distribution inventory system with a central warehouse and a number of retailers is considered. The retailers face stochastic demand and replenish from the warehouse, which, in turn, replenishes from an outside supplier. The system is reviewed continuously and demands that cannot be met directly are backordered. Standard holding and backorder costs are considered. In the literature on multi‐echelon inventory control it is standard to assume that backorders at the warehouse are served according to a first come–first served policy (FCFS). This allocation rule simplifies the analysis but is normally not optimal. It is shown that the FCFS rule can, in the worst case, lead to an asymptotically unbounded relative cost increase as the number of retailers approaches infinity. We also provide a new heuristic that will always give a reduction of the expected costs. A numerical study indicates that the average cost reduction when using the heuristic is about two percent. The suggested heuristic is also compared with two existing heuristics. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
405.
Designing Code Division Multiple Access networks includes determining optimal locations of radio towers and assigning customer markets to the towers. In this paper, we describe a deterministic model for tower location and a stochastic model to optimize revenue given a set of constructed towers. We integrate these models in a stochastic integer programming problem with simple recourse that optimizes the location of towers under demand uncertainty. We develop algorithms using Benders' reformulation, and we provide computational results. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
406.
EOS(对地观测卫星)成像调度需要根据用户提出的成像任务需求确定卫星成像序列,是一个复杂的组合优化问题。考虑到成像侧视约束条件,建立EOS成像调度的多目标有向无环约束图模型。在此模型的基础上提出了基于SPEA2(strength pareto evolutionary algorithm 2)的多目标成像调度算法,采用约束控制技术设计遗传算子处理成像约束。经过三个实际的多目标成像调度问题测试,表明该算法可以有效地解决EOS成像调度问题。 相似文献
407.
For a given set S of nonnegative integers the partitioning problem asks for a partition of S into two disjoint subsets S1 and S2 such that the sum of elements in S1 is equal to the sum of elements in S2. If additionally two elements (the kernels) r1, r2 ∈ S are given which must not be assigned to the same set Si, we get the partitioning problem with kernels. For these NP‐complete problems the authors present two compound algorithms which consist both of three linear greedylike algorithms running independently. It is shown that the worst‐case performance of the heuristic for the ordinary partitioning problem is 12/11, while the second procedure for partitioning with kernels has a bound of 8/7. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 593–601, 2000 相似文献
408.
结合前人在海浪功率谱以及海浪产生磁场两方面的研究 ,求出了海浪 磁场系统的传递函数 ,分析了该系统的性质 ,并利用该传递函数和Neumann谱、PM谱计算了磁场功率谱 ;在此基础上 ,根据实际观测我国海区的海浪高度 周期分布 ,求解海浪分布参数 ,模拟实际的海浪过程 ,求出了实际情况下的海浪感应磁场功率谱 ,并分析了其特性 . 相似文献
409.
James Flynn 《海军后勤学研究》2001,48(5):430-449
Consider an N‐item, periodic review, infinite‐horizon, undiscounted, inventory model with stochastic demands, proportional holding and shortage costs, and full backlogging. For 1 ≤ j ≤ N, orders for item j can arrive in every period, and the cost of receiving them is negligible (as in a JIT setting). Every Tj periods, one reviews the current stock level of item j and decides on deliveries for each of the next Tj periods, thus incurring an item‐by‐item fixed cost kj. There is also a joint fixed cost whenever any item is reviewed. The problem is to find review periods T1, T2, …, TN and an ordering policy satisfying the average cost criterion. The current article builds on earlier results for the single‐item case. We prove an optimal policy exists, give conditions where it has a simple form, and develop a branch and bound algorithm for its computation. We also provide two heuristic policies with O(N) computational requirements. Computational experiments indicate that the branch and bound algorithm can handle normal demand problems with N ≤ 10 and that both heuristics do well for a wide variety of problems with N ranging from 2 to 200; moreover, the performance of our heuristics seems insensitive to N. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:430–449, 2001 相似文献
410.
Common due date problems have been extensively discussed in the scheduling literature. Initially, these problems discussed finding a common due date for a set of jobs on a single machine. These single machine problems were later extended to finding the common due date on a set of parallel machines. This paper further extends the single machine problem to finding multiple common due dates on a single machine. For a basic and important class of penalty functions, we show that this problem is comparable to the parallel machine problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 293–298, 2001 相似文献