全文获取类型
收费全文 | 303篇 |
免费 | 81篇 |
国内免费 | 14篇 |
出版年
2023年 | 3篇 |
2022年 | 5篇 |
2021年 | 3篇 |
2020年 | 11篇 |
2019年 | 8篇 |
2018年 | 6篇 |
2017年 | 15篇 |
2016年 | 15篇 |
2015年 | 13篇 |
2014年 | 29篇 |
2013年 | 22篇 |
2012年 | 25篇 |
2011年 | 16篇 |
2010年 | 18篇 |
2009年 | 26篇 |
2008年 | 24篇 |
2007年 | 32篇 |
2006年 | 23篇 |
2005年 | 13篇 |
2004年 | 19篇 |
2003年 | 11篇 |
2002年 | 10篇 |
2001年 | 10篇 |
2000年 | 6篇 |
1999年 | 5篇 |
1998年 | 3篇 |
1997年 | 1篇 |
1996年 | 6篇 |
1995年 | 7篇 |
1994年 | 2篇 |
1993年 | 1篇 |
1992年 | 2篇 |
1991年 | 3篇 |
1990年 | 2篇 |
1989年 | 3篇 |
排序方式: 共有398条查询结果,搜索用时 15 毫秒
31.
从缩小搜索区域、增强算法的收敛性,以及缩短计算时间的角度出发,提出了解决器材分层集装问题的遗传算法。根据实际情况论述了解决该问题的3步法,并建立了优化的数学模型,构造了适合遗传算法求解的目标函数。实验表明,遗传算法具有很好的全局收敛性,能有效地解决器材分层集装问题。 相似文献
32.
多目标广义指派问题的模糊匈牙利算法求解 总被引:5,自引:0,他引:5
提出和讨论了两类多目标的广义指派决策问题,分别给出了它们的多目标整数线性规划数学模型,并结合模糊理论与解决传统指派问题的匈牙利方法提出了一种新的求解算法:模糊匈牙利法.最后给出了一个数值例子. 相似文献
33.
34.
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 相似文献
35.
36.
A. Garnaev 《海军后勤学研究》2007,54(1):109-114
This paper deals with a two searchers game and it investigates the problem of how the possibility of finding a hidden object simultaneously by players influences their behavior. Namely, we consider the following two‐sided allocation non‐zero‐sum game on an integer interval [1,n]. Two teams (Player 1 and 2) want to find an immobile object (say, a treasure) hidden at one of n points. Each point i ∈ [1,n] is characterized by a detection parameter λi (μi) for Player 1 (Player 2) such that pi(1 ? exp(?λixi)) (pi(1 ? exp(?μiyi))) is the probability that Player 1 (Player 2) discovers the hidden object with amount of search effort xi (yi) applied at point i where pi ∈ (0,1) is the probability that the object is hidden at point i. Player 1 (Player 2) undertakes the search by allocating the total amount of effort X(Y). The payoff for Player 1 (Player 2) is 1 if he detects the object but his opponent does not. If both players detect the object they can share it proportionally and even can pay some share to an umpire who takes care that the players do not cheat each other, namely Player 1 gets q1 and Player 2 gets q2 where q1 + q2 ≤ 1. The Nash equilibrium of this game is found and numerical examples are given. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
37.
In this paper we consider the capacitated multi‐facility Weber problem with the Euclidean, squared Euclidean, and ?p‐distances. This problem is concerned with locating m capacitated facilities in the Euclidean plane to satisfy the demand of n customers with the minimum total transportation cost. The demand and location of each customer are known a priori and the transportation cost between customers and facilities is proportional to the distance between them. We first present a mixed integer linear programming approximation of the problem. We then propose new heuristic solution methods based on this approximation. Computational results on benchmark instances indicate that the new methods are both accurate and efficient. © 2006 Wiley Periodicals, Inc. Naval Research Logistics 2006 相似文献
38.
Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management issues. However, a fundamental prerequisite is the knowledge of the prior target density. Though this assumption has the definite advantage of simplicity, its drawback is clearly that target reactivity is not taken into account. As a preliminary step towards reactive target study stands the problem of resource planning under a min–max game context. This paper is related to Nakai's work about the game planning of resources for the detection of a stationary target. However, this initial problem is extended by adding new and more general constraints, allowing a more realistic modeling of the target and searcher behaviors. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
39.
In this paper we present a new combinatorial problem, called minmax multidimensional knapsack problem (MKP), motivated by a military logistics problem. The logistics problem is a two‐period, two‐level, chance‐constrained problem with recourse. We show that the MKP is NP‐hard and develop a practically efficient combinatorial algorithm for solving it. We also show that under some reasonable assumptions regarding the operational setting of the logistics problem, the chance‐constrained optimization problem is decomposable into a series of MKPs that are solved separately. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
40.
郭际伟 《中国人民武装警察部队学院学报》2007,23(5):89-91
军人伤亡保险作为军人保险制度的重要组成部分,其经济补偿功能已经被广大官兵逐渐认可。但作为分散军人职业风险的特定机制,其作用并未被充分开发出来,主要表现在较低的补偿水平等方面。因此,应充分借鉴国内外的相关经验,扬长避短,以充分发挥军人伤亡保险的作用。 相似文献