全文获取类型
收费全文 | 227篇 |
免费 | 39篇 |
国内免费 | 17篇 |
出版年
2023年 | 2篇 |
2022年 | 6篇 |
2021年 | 1篇 |
2020年 | 4篇 |
2019年 | 3篇 |
2018年 | 6篇 |
2017年 | 14篇 |
2016年 | 27篇 |
2015年 | 5篇 |
2014年 | 20篇 |
2013年 | 19篇 |
2012年 | 23篇 |
2011年 | 17篇 |
2010年 | 13篇 |
2009年 | 17篇 |
2008年 | 19篇 |
2007年 | 21篇 |
2006年 | 20篇 |
2005年 | 11篇 |
2004年 | 8篇 |
2003年 | 4篇 |
2002年 | 5篇 |
2001年 | 5篇 |
2000年 | 2篇 |
1999年 | 1篇 |
1998年 | 2篇 |
1997年 | 3篇 |
1996年 | 3篇 |
1995年 | 1篇 |
1992年 | 1篇 |
排序方式: 共有283条查询结果,搜索用时 281 毫秒
141.
武器-目标分配(WTA)问题研究进展 总被引:9,自引:1,他引:8
对武器-目标分配(WTA)问题的研究现状与进展进行了总结与述评.介绍了WTA问题的概念、基本模型、数学性质以及WTA问题研究的基本内容.目前WTA问题的研究内容主要集中在模型研究与算法研究两个方面.模型研究以静态模型的研究为主,但动态模型的研究还不够深入;算法研究则主要采用智能算法对WTA问题进行求解.目前基本上已经解决了小规模的静态WTA问题,但尚未有效解决大规模的动态WTA问题. 相似文献
142.
Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function
We consider open‐shop scheduling problems where operation‐processing times are a convex decreasing function of a common limited nonrenewable resource. The scheduler's objective is to determine the optimal job sequence on each machine and the optimal resource allocation for each operation in order to minimize the makespan. We prove that this problem is NP‐hard, but for the special case of the two‐machine problem we provide an efficient optimization algorithm. We also provide a fully polynomial approximation scheme for solving the preemptive case. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
143.
面向对等网络信息资源语义共享问题,首先提出了一种基于多本体的资源元数据描述框架,将资源元数据分为核心和扩展两部分,在此基础上重点对资源元数据索引策略进行了研究,提出了一种混合索引机制,针对资源核心元数据采用一种社区策略来进行组织索引,针对扩展元数据采取DHT和语义关联相结合的方式进行组织索引,其中结合了本地索引和全局索引的特点,并在此基础上对资源发现流程和负载均衡方法进行了设计。与现有相关系统相比,本索引体系有效地提高了对等网络环境下资源定位的效率和系统的可扩展能力。 相似文献
144.
新疆地大物博,有着发展农业的资源优势,只有抓住“西部大开发”这个机遇,以市场为导向,加大产业 结构调整力度,积极推进农业产业化进程,以保护生态环境为前提,发展生态农业,才能促进新疆农业可持续发展。 相似文献
145.
Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks 下载免费PDF全文
Noam Goldberg 《海军后勤学研究》2017,64(2):139-153
A simultaneous non‐zero‐sum game is modeled to extend the classical network interdiction problem. In this model, an interdictor (e.g., an enforcement agent) decides how much of an inspection resource to spend along each arc in the network to capture a smuggler. The smuggler (randomly) selects a commodity to smuggle—a source and destination pair of nodes, and also a corresponding path for traveling between the given pair of nodes. This model is motivated by a terrorist organization that can mobilize its human, financial, or weapon resources to carry out an attack at one of several potential target destinations. The probability of evading each of the network arcs nonlinearly decreases in the amount of resource that the interdictor spends on its inspection. We show that under reasonable assumptions with respect to the evasion probability functions, (approximate) Nash equilibria of this game can be determined in polynomial time; depending on whether the evasion functions are exponential or general logarithmically‐convex functions, exact Nash equilibria or approximate Nash equilibria, respectively, are computed. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 139–153, 2017 相似文献
146.
147.
超视距多目标攻击排序及火力分配建模与解算 总被引:17,自引:3,他引:14
针对未来超视距空战条件下的多目标攻击排序和制导武器火力分配问题,提出了一种用以评估超视距空战作战效能的综合优势指数法;当目标数多于攻击机数时,通过构造综合优势矩阵,将非平衡指派问题转化为平衡指派问题,并建立了多目标攻击排序的0-1规划模型,该模型可解决对多个目标同时攻击的排序问题;以2对8攻击排序为例,利用求解线性规划软件Lindo6.0进行解算。最后,建立了1对4攻击火力分配的非线性规划模型,并利用求解非线性规划软件Lingo5.0进行解算。计算结果验证了建模的合理性和运用Lindo、Lingo软件求解较大规模目标攻击排序和火力分配问题的实时性。 相似文献
148.
The well‐known generalized assignment problem (GAP) involves the identification of a minimum‐cost assignment of tasks to agents when each agent is constrained by a resource in limited supply. The multi‐resource generalized assignment problem (MRGAP) is the generalization of the GAP in which there are a number of different potentially constraining resources associated with each agent. This paper explores heuristic procedures for the MRGAP. We first define a three‐phase heuristic which seeks to construct a feasible solution to MRGAP and then systematically attempts to improve the solution. We then propose a modification of the heuristic for the MRGAP defined previously by Gavish and Pirkul. The third procedure is a hybrid heuristic that combines the first two heuristics, thus capturing their relative strengths. We discuss extensive computational experience with the heuristics. The hybrid procedure is seen to be extremely effective in solving MRGAPs, generating feasible solutions to more than 99% of the test problems and consistently producing near‐optimal solutions. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 468–483, 2001 相似文献
149.
论火灾与可持续发展观的内在联系 总被引:1,自引:0,他引:1
蔡畅宇 《中国人民武装警察部队学院学报》2001,17(6):29-33
可持续发展是人类迫切解决的问题,火灾对可持续发展构成巨大威胁.针对火灾的危害,从防灾角度研究可持续发展观,揭示火灾与可持续发展的内在联系,为人类有效控制火灾提供正确的认识论和科学的方法论. 相似文献
150.
We revisit the capacity investment decision problem studied in the article “Resource Flexibility with Responsive Pricing” by Chod and Rudi [Operations Research 53, (2005) 532–548]. A monopolist firm producing two dependent (substitutable or complementary) products needs to determine the capacity of one flexible resource under demand risk so as to maximize its expected profit. Product demands are linear functions of the prices of both products, and the market potentials are random and correlated. We perform a comparative statics analysis on how demand variability and correlation impact the optimal capacity and the resulting expected profit. In particular, C&R study this problem under the following assumptions/approximations: (i) demand intercepts follow a bivariate Normal distribution; (ii) demand uncertainty is of an additive form; (iii) and under approximate expressions for the optimal capacity and optimal expected profit. We revisit Propositions 2, 3, 4, 5, and 10 of C&R without these assumptions and approximations, and show that these results continue to hold (i) for the exact expressions for the optimal expected profit and optimal capacity, and (ii) under any arbitrary continuous distribution of demand intercepts. However, we also show that the additive demand uncertainty is a critical assumption for the C&R results to hold. In particular, we provide a case of multiplicative uncertainty under which the C&R results (Propositions 2 and 3) fail. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010 相似文献