全文获取类型
收费全文 | 235篇 |
免费 | 92篇 |
国内免费 | 18篇 |
专业分类
345篇 |
出版年
2023年 | 2篇 |
2022年 | 2篇 |
2021年 | 2篇 |
2020年 | 7篇 |
2019年 | 5篇 |
2018年 | 2篇 |
2017年 | 18篇 |
2016年 | 19篇 |
2015年 | 15篇 |
2014年 | 18篇 |
2013年 | 16篇 |
2012年 | 13篇 |
2011年 | 12篇 |
2010年 | 10篇 |
2009年 | 24篇 |
2008年 | 19篇 |
2007年 | 20篇 |
2006年 | 24篇 |
2005年 | 14篇 |
2004年 | 17篇 |
2003年 | 8篇 |
2002年 | 7篇 |
2001年 | 10篇 |
2000年 | 8篇 |
1999年 | 5篇 |
1998年 | 4篇 |
1997年 | 6篇 |
1996年 | 5篇 |
1995年 | 4篇 |
1994年 | 2篇 |
1993年 | 6篇 |
1992年 | 4篇 |
1991年 | 5篇 |
1990年 | 9篇 |
1989年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有345条查询结果,搜索用时 0 毫秒
21.
在对军事决策问题的主要特点进行分析的基础上,提出从军事概念模型到数学模型再到定性推理模型的一体化建模思想.以空军航空兵遂行直接航空火力支援任务为想定背景,根据EATI模板,利用基于UML的Rose工具依次对想定任务的实体、任务、交互等进行分析;对于兵力筹划中的结构化问题建立了机会约束多目标规划数学模型;对于非结构化问题则构造了推理机,推理机体现了定量与定性相结合的决策分析思想.最后,以一个实例验证文章思路的可行性. 相似文献
22.
23.
提出了用小生境遗传模拟退火算法求解带复杂约束的非线性规划问题。首先分析了遗传算法"早熟"收敛以及局部搜索能力弱的不足,由此引入小生境以增加种群多样性,并抑制"早熟"收敛现象,同时引入模拟退火算法以增强局部搜索能力,改进进化后期收敛速度慢的不足,最后结合典型非线性规划算例验证了混合算法的效率、精度和可靠性。 相似文献
24.
The “gold‐mining” decision problem is concerned with the efficient utilization of a delicate mining equipment working in a number of different mines. Richard Bellman was the first to consider this type of a problem. The solution found by Bellman for the finite‐horizon, continuous‐time version of the problem with two mines is not overly realistic since he assumed that fractional parts of the same mining equipment could be used in different mines and this fraction could change instantaneously. In this paper, we provide some extensions to this model in order to produce more operational and realistic solutions. Our first model is concerned with developing an operational policy where the equipment may be switched from one mine to the other at most once during a finite horizon. In the next extension we incorporate a cost component in the objective function and assume that the horizon length is not fixed but it is the second decision variable. Structural properties of the optimal solutions are obtained using nonlinear programming. Each model and its solution is illustrated with a numerical example. The models developed here may have potential applications in other areas including production of items requiring the same machine or choosing a sequence of activities requiring the same resource. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 186–203, 2002; DOI 10.1002/nav.10008 相似文献
25.
We consider a make‐to‐order production–distribution system with one supplier and one or more customers. A set of orders with due dates needs to be processed by the supplier and delivered to the customers upon completion. The supplier can process one order at a time without preemption. Each customer is at a distinct location and only orders from the same customer can be batched together for delivery. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the supplier and order delivery from the supplier to the customers that optimizes an objective function involving the maximum delivery tardiness and the total distribution cost. We first study the solvability of various cases of the problem by either providing an efficient algorithm or proving the intractability of the problem. We then develop a fast heuristic for the general problem. We show that the heuristic is asymptotically optimal as the number of orders goes to infinity. We also evaluate the performance of the heuristic computationally by using lower bounds obtained by a column generation approach. Our results indicate that the heuristic is capable of generating near optimal solutions quickly. Finally, we study the value of production–distribution integration by comparing our integrated approach with two sequential approaches where scheduling decisions for order processing are made first, followed by order delivery decisions, with no or only partial integration of the two decisions. We show that in many cases, the integrated approach performs significantly better than the sequential approaches. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
26.
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 相似文献
27.
分析了战时装备调配保障决策的特点,运用模糊聚类分析法对装备调配保障对象进行了分组和优先级排序,以此为基础,运用目标规划法构建了战时装备调配保障决策模型,最后,通过实例验证了模型的可行性和有效性. 相似文献
28.
针对球约束凸二次规划问题,利用Lagrange对偶将其转化为无约束优化问题,然后运用单纯形法对其求解,获得原问题的最优解。最后,对文中给出的算法给出了论证。 相似文献
29.
30.