全文获取类型
收费全文 | 373篇 |
免费 | 80篇 |
国内免费 | 14篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 4篇 |
2021年 | 7篇 |
2020年 | 10篇 |
2019年 | 7篇 |
2018年 | 6篇 |
2017年 | 13篇 |
2016年 | 13篇 |
2015年 | 24篇 |
2014年 | 17篇 |
2013年 | 70篇 |
2012年 | 19篇 |
2011年 | 24篇 |
2010年 | 21篇 |
2009年 | 27篇 |
2008年 | 27篇 |
2007年 | 27篇 |
2006年 | 17篇 |
2005年 | 20篇 |
2004年 | 16篇 |
2003年 | 12篇 |
2002年 | 11篇 |
2001年 | 13篇 |
2000年 | 10篇 |
1999年 | 11篇 |
1998年 | 7篇 |
1997年 | 8篇 |
1996年 | 4篇 |
1995年 | 1篇 |
1994年 | 3篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1991年 | 3篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1988年 | 2篇 |
1987年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有467条查询结果,搜索用时 15 毫秒
161.
The parallel machine replacement problem consists of finding a minimum cost replacement policy for a finite population of economically interdependent machines. In this paper, we formulate a stochastic version of the problem and analyze the structure of optimal policies under general classes of replacement cost functions. We prove that for problems with arbitrary cost functions, there can be optimal policies where a machine is replaced only if all machines in worse states are replaced (Worse Cluster Replacement Rule). We then show that, for problems with replacement cost functions exhibiting nonincreasing marginal costs, there are optimal policies such that, in any stage, machines in the same state are either all kept or all replaced (No‐Splitting Rule). We also present an example that shows that economies of scale in replacement costs do not guarantee optimal policies that satisfy the No‐Splitting Rule. These results lead to the fundamental insight that replacement decisions are driven by marginal costs, and not by economies of scale as suggested in the literature. Finally, we describe how the optimal policy structure, i.e., the No‐Splitting and Worse Cluster Replacement Rules, can be used to reduce the computational effort required to obtain optimal replacement policies. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
162.
We study a generalization of the weighted set covering problem where every element needs to be covered multiple times. When no set contains more than two elements, we can solve the problem in polynomial time by solving a corresponding weighted perfect b‐matching problem. In general, we may use a polynomial‐time greedy heuristic similar to the one for the classical weighted set covering problem studied by D.S. Johnson [Approximation algorithms for combinatorial problems, J Comput Syst Sci 9 (1974), 256–278], L. Lovasz [On the ratio of optimal integral and fractional covers, Discrete Math 13 (1975), 383–390], and V. Chvatal [A greedy heuristic for the set‐covering problem, Math Oper Res 4(3) (1979), 233–235] to get an approximate solution for the problem. We find a worst‐case bound for the heuristic similar to that for the classical problem. In addition, we introduce a general type of probability distribution for the population of the problem instances and prove that the greedy heuristic is asymptotically optimal for instances drawn from such a distribution. We also conduct computational studies to compare solutions resulting from running the heuristic and from running the commercial integer programming solver CPLEX on problem instances drawn from a more specific type of distribution. The results clearly exemplify benefits of using the greedy heuristic when problem instances are large. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
163.
张媛 《中国人民武装警察部队学院学报》2006,22(3):56-59
在阅读英语时,首先遇到的问题是生词。如果时时停下来查词典,就会影响思维的连续性、阅读速度甚至丧失阅读兴趣。外语教学中常常提到根据上下文了解词义,即在碰到难以理解的词语时,可以引导学生根据词汇语境线索和已知信息及构词法来进行推测。掌握猜词解义的方法,有助于提高阅读能力。 相似文献
164.
介绍了一种用于指挥自动化网络中进行身份认证的USB安全钥安全管理系统,给出了使用USB安全钥进入网络终端时的认证机制,调用与浏览服务器信息时的认证流程,以及USB安全钥软、硬件的设计要点.在该安全钥管理系统中可运行重要软件的关键程序和查询关键信息,有效增强保密强度,安全钥采用USB接口,具有支持热插拔、携带方便等优点. 相似文献
165.
We deal with the problem of minimizing makespan on a single batch processing machine. In this problem, each job has both processing time and size (capacity requirement). The batch processing machine can process a number of jobs simultaneously as long as the total size of these jobs being processed does not exceed the machine capacity. The processing time of a batch is just the processing time of the longest job in the batch. An approximation algorithm with worst‐case ratio 3/2 is given for the version where the processing times of large jobs (with sizes greater than 1/2) are not less than those of small jobs (with sizes not greater than 1/2). This result is the best possible unless P = NP. For the general case, we propose an approximation algorithm with worst‐case ratio 7/4. A number of heuristics by Uzosy are also analyzed and compared. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 226–240, 2001 相似文献
166.
Ebru K. Bish Thin‐Yin Leong Chung‐Lun Li Jonathan W. C. Ng David Simchi‐Levi 《海军后勤学研究》2001,48(5):363-385
We consider a container terminal discharging containers from a ship and locating them in the terminal yard. Each container has a number of potential locations in the yard where it can be stored. Containers are moved from the ship to the yard using a fleet of vehicles, each of which can carry one container at a time. The problem is to assign each container to a yard location and dispatch vehicles to the containers so as to minimize the time it takes to download all the containers from the ship. We show that the problem is NP‐hard and develop a heuristic algorithm based on formulating the problem as an assignment problem. The effectiveness of the heuristic is analyzed from both worst‐case and computational points of view. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 363–385, 2001 相似文献
167.
168.
169.
Mehrez, Stern, and Ronen have defined a vehicle refueling problem in which a fleet of vehicles travels on a round-trip, self-contained mission from a common origin, with the objective of maximizing the operational range of the fleet. They have defined a “pure refueling chain” strategy for transferring fuel between vehicles in the fleet, and have solved the problem in the special cases when all vehicles have the same fuel capacity or consumption rate. In this article we present algorithms for the general case, where vehicles have different capacities and consumption rates. Our approach is based on a new primal dual formulation of the problem. The exact algorithm was effective to find the optimal solution for a fleet size n ⩽13. For larger fleets, we present an approximation version of it, which very quickly found a solution within 1% of the maximum possible range for arbitrarily large (up to n = 200) fleets. We also show that a small number of the best vehicles can always reach almost the same range as a large fleet. © 1992 John Wiley & Sons, Inc. 相似文献
170.
陈媛 《中国人民武装警察部队学院学报》2010,26(2):91-93
控制下交付作为打击毒品犯罪尤其是跨国有组织毒品犯罪的重要措施和手段,已发挥越来越重要的作用,是其他缉毒措施和手段无法取代的。但是,由于毒品犯罪的集团化、国际化、种类多元化程度加剧,使得控制下交付的复杂性与不确定性越来越明显。鉴于此,将AHP植入SWOT分析法中,以定性和定量相结合的科学方法解决控制下交付行动方案的优选问题,对提高控制下交付的成功率具有重要意义。 相似文献