全文获取类型
收费全文 | 1048篇 |
免费 | 450篇 |
国内免费 | 93篇 |
出版年
2024年 | 1篇 |
2023年 | 13篇 |
2022年 | 12篇 |
2021年 | 32篇 |
2020年 | 32篇 |
2019年 | 29篇 |
2018年 | 24篇 |
2017年 | 54篇 |
2016年 | 75篇 |
2015年 | 51篇 |
2014年 | 83篇 |
2013年 | 87篇 |
2012年 | 92篇 |
2011年 | 84篇 |
2010年 | 53篇 |
2009年 | 95篇 |
2008年 | 76篇 |
2007年 | 82篇 |
2006年 | 101篇 |
2005年 | 77篇 |
2004年 | 72篇 |
2003年 | 55篇 |
2002年 | 44篇 |
2001年 | 44篇 |
2000年 | 40篇 |
1999年 | 27篇 |
1998年 | 30篇 |
1997年 | 14篇 |
1996年 | 23篇 |
1995年 | 17篇 |
1994年 | 19篇 |
1993年 | 5篇 |
1992年 | 20篇 |
1991年 | 8篇 |
1990年 | 13篇 |
1989年 | 5篇 |
1988年 | 2篇 |
排序方式: 共有1591条查询结果,搜索用时 312 毫秒
31.
多目标广义指派问题的模糊匈牙利算法求解 总被引:5,自引:0,他引:5
提出和讨论了两类多目标的广义指派决策问题,分别给出了它们的多目标整数线性规划数学模型,并结合模糊理论与解决传统指派问题的匈牙利方法提出了一种新的求解算法:模糊匈牙利法.最后给出了一个数值例子. 相似文献
32.
33.
34.
This article introduces the use of Benders' cuts to guide a large neighborhood search to solve the traveling umpire problem, a sports scheduling problem inspired by the real‐life needs of the officials of a sports league. At each time slot, a greedy matching heuristic is used to construct a schedule. When an infeasibility is recognized first a single step backtracking is tried to resolve the infeasibility. If unsuccessful, Benders' cuts are generated to guide a large neighborhood search to ensure feasibility and to improve the solution. Realizing the inherent symmetry present in the problem, a large family of cuts are generated and their effectiveness is tested. The resulting approach is able to find better solutions to many instances of this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
35.
In this article, we consider the concurrent open shop scheduling problem to minimize the total weighted completion time. When the number of machines is arbitrary, the problem has been shown to be inapproximable within a factor of 4/3 ‐ ε for any ε > 0 if the unique games conjecture is true in the literature. We propose a polynomial time approximation scheme for the problem under the restriction that the number of machines is fixed. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
36.
针对传统的无线传感器网络数据收集协议大多受制于发生在基站周围的热点问题,提出了一种使用移动基站的数据收集方法.将数据收集问题转化为支配集构造和旅行商问题,并提出了一种分布式的支配集构建算法,结合旅行商问题的近似算法生成基站的移动路线.仿真结果表明,所提出的方法减少了通信消耗,且能使负载均衡地分布. 相似文献
37.
The problem of minimum makespan on an m machine jobshop with unit execution time (UET) jobs (m ≥ 3) is known to be strongly NP‐hard even with no setup times. We focus in this article on the two‐machine case. We assume UET jobs and consider batching with batch availability and machine‐dependent setup times. We introduce an efficient \begin{align*}(O(\sqrt{n}))\end{align*} algorithm, where n is the number of jobs. We then introduce a heuristic for the multimachine case and demonstrate its efficiency for two interesting instances. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
38.
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 相似文献
39.
In this article, we discuss the optimal allocation problem in a multiple stress levels life‐testing experiment when an extreme value regression model is used for statistical analysis. We derive the maximum likelihood estimators, the Fisher information, and the asymptotic variance–covariance matrix of the maximum likelihood estimators. Three optimality criteria are defined and the optimal allocation of units for two‐ and k‐stress level situations are determined. We demonstrate the efficiency of the optimal allocation of units in a multiple stress levels life‐testing experiment by using real experimental situations discussed earlier by McCool and Nelson and Meeker. Monte Carlo simulations are used to show that the optimality results hold for small sample sizes as well. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
40.
根据临床诊断支持信息环境的特点,结合Agent技术,设计了一套基于Multi-agent的临床诊断支持系统(CDSS)。该系统具有异构性、分布性、并行性和可扩展性,能适应CDSS的要求,有效地提高CDSS的性能。 相似文献