全文获取类型
收费全文 | 868篇 |
免费 | 410篇 |
国内免费 | 96篇 |
出版年
2024年 | 2篇 |
2023年 | 20篇 |
2022年 | 9篇 |
2021年 | 30篇 |
2020年 | 36篇 |
2019年 | 22篇 |
2018年 | 12篇 |
2017年 | 74篇 |
2016年 | 79篇 |
2015年 | 66篇 |
2014年 | 81篇 |
2013年 | 85篇 |
2012年 | 84篇 |
2011年 | 68篇 |
2010年 | 52篇 |
2009年 | 88篇 |
2008年 | 62篇 |
2007年 | 70篇 |
2006年 | 72篇 |
2005年 | 58篇 |
2004年 | 58篇 |
2003年 | 32篇 |
2002年 | 39篇 |
2001年 | 30篇 |
2000年 | 25篇 |
1999年 | 22篇 |
1998年 | 19篇 |
1997年 | 16篇 |
1996年 | 15篇 |
1995年 | 10篇 |
1994年 | 12篇 |
1993年 | 9篇 |
1992年 | 3篇 |
1991年 | 2篇 |
1990年 | 9篇 |
1989年 | 3篇 |
排序方式: 共有1374条查询结果,搜索用时 15 毫秒
121.
多目标广义指派问题的模糊匈牙利算法求解 总被引:5,自引:0,他引:5
提出和讨论了两类多目标的广义指派决策问题,分别给出了它们的多目标整数线性规划数学模型,并结合模糊理论与解决传统指派问题的匈牙利方法提出了一种新的求解算法:模糊匈牙利法.最后给出了一个数值例子. 相似文献
122.
123.
网络图式军用文书是战时通用装备保障文书中通常采用的文书形式之一,给出装备保障文书辅助生成系统的总体结构,将网络分析方法引入通用装备保障文书辅助生成系统的研究,在此基础上阐述了网络图式文书生成子系统的功能、数学模型及网络计算、网络优化的部分算法。 相似文献
124.
A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem
The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
125.
We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
126.
127.
In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007. 相似文献
128.
129.
相控阵天线关键技术发展趋势 总被引:2,自引:0,他引:2
相控阵天线必然朝着降低成本和提高性能的趋势发展,因此从以下几个方面分析其关键技术的发展方向:增加带宽,提高T/R组件的附加功率效率,移相器技术,数字化电路,以及引入稀布阵技术等。对相控阵技术的需求也是对这些相关技术发展的一种重要的推动力。 相似文献
130.