全文获取类型
| 收费全文 | 335篇 |
| 免费 | 6篇 |
| 国内免费 | 2篇 |
专业分类
| 343篇 |
出版年
| 2025年 | 1篇 |
| 2024年 | 1篇 |
| 2023年 | 5篇 |
| 2022年 | 3篇 |
| 2021年 | 2篇 |
| 2020年 | 7篇 |
| 2019年 | 5篇 |
| 2018年 | 1篇 |
| 2017年 | 15篇 |
| 2016年 | 17篇 |
| 2015年 | 15篇 |
| 2014年 | 18篇 |
| 2013年 | 16篇 |
| 2012年 | 14篇 |
| 2011年 | 11篇 |
| 2010年 | 10篇 |
| 2009年 | 23篇 |
| 2008年 | 17篇 |
| 2007年 | 20篇 |
| 2006年 | 24篇 |
| 2005年 | 13篇 |
| 2004年 | 17篇 |
| 2003年 | 8篇 |
| 2002年 | 7篇 |
| 2001年 | 10篇 |
| 2000年 | 8篇 |
| 1999年 | 5篇 |
| 1998年 | 4篇 |
| 1997年 | 6篇 |
| 1996年 | 5篇 |
| 1995年 | 4篇 |
| 1994年 | 3篇 |
| 1993年 | 6篇 |
| 1992年 | 5篇 |
| 1991年 | 5篇 |
| 1990年 | 9篇 |
| 1989年 | 2篇 |
| 1988年 | 1篇 |
排序方式： 共有343条查询结果，搜索用时 0 毫秒
51.
This article considers batch scheduling with centralized and decentralized decisions. The context of our study is concurrent open shop scheduling where the jobs are to be processed on a set of independent dedicated machines, which process designated operations of the jobs in batches. The batching policy across the machines can be centralized or decentralized. We study such scheduling problems with the objectives of minimizing the maximum lateness, weighted number of tardy jobs, and total weighted completion time, when the job sequence is determined in advance. We present polynomial time dynamic programming algorithms for some cases of these problems and pseudo‐polynomial time algorithms for some problems that are NP‐hard in the ordinary sense. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 17–27, 2011 相似文献
52.
In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
53.
Ryusuke Hohzaki 《海军后勤学研究》2008,55(1):76-90
This article deals with a two‐person zero‐sum game called a search allocation game (SAG), in which a searcher and a target participate as players. The searcher distributes his searching resources in a search space to detect the target. The effect of resources lasts a certain period of time and extends to some areas at a distance from the resources' dropped points. On the other hand, the target moves around in the search space to evade the searcher. In the history of search games, there has been little research covering the durability and reachability of searching resources. This article proposes two linear programming formulations to solve the SAG with durable and reachable resources, and at the same time provide an optimal strategy of distributing searching resources for the searcher and an optimal moving strategy for the target. Using examples, we will analyze the influences of two attributes of resources on optimal strategies. © 2007 Wiley Periodicals, Inc. Naval Research Logistics 2008 相似文献
54.
针对部队实兵对抗实验数据生成和采集的投入高、难度大的实际,提出基于小样本数据生成作战计划的方法：首先,采用偏最小二乘回归分析法建立作战因素与作战结果间的多元非线性模型;其次,采用改进的遗传算法,在MATLAB平台编程实现了对模型的整数规划求解,并通过实例验证算法的有效性;最后,利用作战因素的重要性排序分析作战计划的调整流程。 相似文献
55.
B. Jay Coleman 《海军后勤学研究》2014,61(1):17-33
This article presents two meta‐ranking models that minimize or nearly minimize violations of past game results while predicting future game winners as well as or better than leading current systems—a combination never before offered for college football. Key to both is the development and integration of a highly predictive ensemble probability model generated from the analysis of 36 existing college football ranking systems. This ensemble model is used to determine a target ranking that is used in two versions of a hierarchical multiobjective mixed binary integer linear program (MOMBILP). When compared to 75 other systems out‐of‐sample, one MOMBILP was the leading predictive system while getting within 0.64% of the retrodictive optimum; the other MOMBILP minimized violations while achieving a prediction total that was 2.55% lower than the best mark. For bowls, prediction sums were not statistically significantly different from the leading value, while achieving optimum or near‐optimum violation counts. This performance points to these models as potential means of reconciling the contrasting perspectives of predictiveness versus the matching of past performance when it comes to ranking fairness in college football. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 17–33, 2014 相似文献
56.
面向对象的反舰导弹航路规划 总被引：1，自引：0，他引：1
针对反舰导弹航路规划的任务特点,提出了一种面向对象的反舰导弹航路规划方法。在全面分析了反舰导弹航路规划中可能用到的类的基础上,建立了对各种类的描述,使得不同算法和不同任务要求的航路规划可以通过对类的继承和对成员函数的重载实现。最后,在VC++平台下,对这种面向对象的反舰导弹航路规划方法进行了编程实验。 相似文献
57.
针对小推力轨道优化设计问题,提出一种基于运动合成的新方法。给出基于运动合成的小推力轨道机动表达方式,将小推力轨道运动分解成相对独立的三项:单独考虑日心引力的二体轨道运动,单独考虑小推力的运动,以及小推力的存在引起的日心引力摄动作用下的运动。分别给出各项运动的解析表达式,通过合成叠加得到小推力轨道的近似解析解。在此基础上,将小推力轨道优化问题转化成非线性规划问题,并利用序列二次规划方法求解。以小行星1989ML、火星和金星交会任务为例分别进行仿真实验,结果表明,所设计轨道满足任务约束,验证了该方法具有可用性和高效性。 相似文献
58.
针对SMP机群,探讨了分别利用单机优化、OpenMP与MPI从指令级、共享存储级与分布主存级三个层次上改善矩阵并行乘Fox算法性能的方法。并通过调用数学函数库与混合编程的方式,在深腾6800上进行了实验,取得了相当满意的数值效果。 相似文献
59.
讨论了在复Chebyshev逼近意义下设计复系数FIR滤波器问题。直接把复Chebyshev逼近问题离散化成有限维线性规划问题 ,再用单纯形法求解这种方法一直被认为只能设计实系数滤波器 ,而且计算量大、收敛速度慢。本文从直接离散化出发 ,推导出一种求解此问题的改进的单纯形算法 ,适用于设计复系数滤波器 ,极大地减小了计算量 ,提高了收敛速度。并证明了它与通过求解半无限线性规划的对偶问题而得到的改进的单纯形法是等价的。最后给出了算法的仿真结果 相似文献
60.