全文获取类型
收费全文 | 197篇 |
免费 | 50篇 |
国内免费 | 6篇 |
出版年
2022年 | 3篇 |
2021年 | 1篇 |
2020年 | 4篇 |
2019年 | 5篇 |
2018年 | 1篇 |
2017年 | 6篇 |
2016年 | 10篇 |
2015年 | 8篇 |
2014年 | 12篇 |
2013年 | 12篇 |
2012年 | 13篇 |
2011年 | 9篇 |
2010年 | 13篇 |
2009年 | 16篇 |
2008年 | 19篇 |
2007年 | 19篇 |
2006年 | 16篇 |
2005年 | 9篇 |
2004年 | 16篇 |
2003年 | 8篇 |
2002年 | 9篇 |
2001年 | 7篇 |
2000年 | 7篇 |
1999年 | 5篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1996年 | 6篇 |
1995年 | 5篇 |
1994年 | 3篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 2篇 |
1989年 | 2篇 |
排序方式: 共有253条查询结果,搜索用时 15 毫秒
211.
周兢 《中国人民武装警察部队学院学报》2009,25(3):46-49
消防中介机构法制建设还存在很多问题,立法滞后,执法不严,必须加强法制建设,促进消防中介机构规范运行,以利于消防中介机构的健康发展。 相似文献
212.
213.
一般武器-目标分配问题,是使武器发挥最大效能而使目标遭受最大毁伤的最优化问题.遗传算法广泛用于解决最优化问题.提出一种具有贪心优化机制的局部搜索方法,以提高遗传算法的搜索效率,从而迅速找到全局最优解.应用于炮兵武器-目标分配问题的仿真试验结果表明,此算法比现有的其他搜寻算法具有更好的求解效率. 相似文献
214.
The warehouse problem with deterministic production cost, selling prices, and demand was introduced in the 1950s and there is a renewed interest recently due to its applications in energy storage and arbitrage. In this paper, we consider two extensions of the warehouse problem and develop efficient computational algorithms for finding their optimal solutions. First, we consider a model where the firm can invest in capacity expansion projects for the warehouse while simultaneously making production and sales decisions in each period. We show that this problem can be solved with a computational complexity that is linear in the product of the length of the planning horizon and the number of capacity expansion projects. We then consider a problem in which the firm can invest to improve production cost efficiency while simultaneously making production and sales decisions in each period. The resulting optimization problem is non‐convex with integer decision variables. We show that, under some mild conditions on the cost data, the problem can be solved in linear computational time. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 367–373, 2016 相似文献
215.
216.
217.
218.
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 相似文献
219.
王胜兵 《海军工程大学学报》2001,13(2):45-48
引入带权的Sobolev空间 ,讨论了奇型非线性抛物问题的有限元方法 ,在a(u) ,f(u)均满足Lips chitz条件下 ,证明了相应椭圆投影算子Rhu与u之间误差估计式 ,并在一定的假设下 ,给出了奇型非线性抛物问题的广义解u及半离散问题的有限元解uh 误差估计式 . 相似文献
220.
A mathematical formulation of an optimization model designed to select projects for inclusion in an R&D portfolio, subject to a wide variety of constraints (e.g., capital, headcount, strategic intent, etc.), is presented. The model is similar to others that have previously appeared in the literature and is in the form of a mixed integer programming (MIP) problem known as the multidimensional knapsack problem. Exact solution of such problems is generally difficult, but can be accomplished in reasonable time using specialized algorithms. The main contribution of this paper is an examination of two important issues related to formulation of project selection models such as the one presented here. If partial funding and implementation of projects is allowed, the resulting formulation is a linear programming (LP) problem which can be solved quite easily. Several plausible assumptions about how partial funding impacts project value are presented. In general, our examples suggest that the problem might best be formulated as a nonlinear programming (NLP) problem, but that there is a need for further research to determine an appropriate expression for the value of a partially funded project. In light of that gap in the current body of knowledge and for practical reasons, the LP relaxation of this model is preferred. The LP relaxation can be implemented in a spreadsheet (even for relatively large problems) and gives reasonable results when applied to a test problem based on GM's R&D project selection process. There has been much discussion in the literature on the topic of assigning a quantitative measure of value to each project. Although many alternatives are suggested, no one way is universally accepted as the preferred way. There does seem to be general agreement that all of the proposed methods are subject to considerable uncertainty. A systematic way to examine the sensitivity of project selection decisions to variations in the measure of value is developed. It is shown that the solution for the illustrative problem is reasonably robust to rather large variations in the measure of value. We cannot, however, conclude that this would be the case in general. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 18–40, 2001 相似文献