全文获取类型
收费全文 | 601篇 |
免费 | 17篇 |
专业分类
618篇 |
出版年
2019年 | 7篇 |
2018年 | 11篇 |
2017年 | 15篇 |
2016年 | 16篇 |
2015年 | 10篇 |
2014年 | 8篇 |
2013年 | 150篇 |
2011年 | 5篇 |
2010年 | 5篇 |
2009年 | 5篇 |
2007年 | 6篇 |
2005年 | 9篇 |
2004年 | 8篇 |
2003年 | 8篇 |
2002年 | 11篇 |
2001年 | 7篇 |
2000年 | 7篇 |
1999年 | 9篇 |
1998年 | 9篇 |
1997年 | 13篇 |
1996年 | 7篇 |
1995年 | 12篇 |
1994年 | 15篇 |
1993年 | 15篇 |
1992年 | 14篇 |
1991年 | 14篇 |
1990年 | 8篇 |
1989年 | 7篇 |
1988年 | 9篇 |
1987年 | 14篇 |
1986年 | 5篇 |
1985年 | 9篇 |
1984年 | 10篇 |
1983年 | 6篇 |
1982年 | 7篇 |
1981年 | 11篇 |
1980年 | 7篇 |
1979年 | 12篇 |
1978年 | 11篇 |
1977年 | 6篇 |
1976年 | 9篇 |
1975年 | 10篇 |
1974年 | 10篇 |
1973年 | 6篇 |
1972年 | 11篇 |
1971年 | 9篇 |
1970年 | 5篇 |
1969年 | 5篇 |
1968年 | 7篇 |
1967年 | 7篇 |
排序方式: 共有618条查询结果,搜索用时 7 毫秒
171.
T.C. Edwin Cheng Qing Ding Mikhail Y. Kovalyov Aleksander Bachman Adam Janiak 《海军后勤学研究》2003,50(6):531-554
We study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job completion time. The single machine problems are proved to be NP‐hard, and some properties of their optimal solutions are established. A pseudopolynomial time algorithm is constructed for makespan minimization. Several heuristics are derived for both total completion time and makespan minimization. Computational experiments are conducted to evaluate their efficiency. NP‐hardness proofs and polynomial time algorithms are presented for some special cases of the parallel machine problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 531–554, 2003 相似文献
172.
John Ishiyama Felipe Carlos Betancourt Higareda Amalia Pulido Bernardo Almaraz 《Civil Wars》2018,20(1):1-23
What is the relationship between drug violence and political attitudes? In this article, we test the relationship between violence and trust using both individual and municipality data for Mexico from 2006 to 12. Using multilevel analysis, we find no support for the thesis that individual experiences with criminal violence drives trust, nor do we find a relationship between levels of violence at the municipio level and trust. However, we do find that perceived threats to individual security leads to less social and institutional trust, but this is independent of personal experience and whether the individual resides in violent communities. 相似文献
173.
Christopher C. Locksley Marjan Male ic MSc Tim Ripley 《Defense & Security Analysis》1993,9(3):357-361
Winning the Next War: Innovation and the Modern Military. By Stephen Peter Rosen. Cornell Studies in Security Affairs, Cornell University Press, New York (1991), ISBN 0-8014-2566-5. Price £40.00
Post-Military Society. By Martin Shaw. Polity Press, Cambridge (1991), ISBN 0-7456-01987 (hardback) £35.00,0-7456-01995 (paperback) £11.95
Big Boys' Rules—The Secret War Against the IRA. By Mark Urban. Faber and Faber, London (1992), ISBN 0-571-16112-X, £14.99 相似文献
Post-Military Society. By Martin Shaw. Polity Press, Cambridge (1991), ISBN 0-7456-01987 (hardback) £35.00,0-7456-01995 (paperback) £11.95
Big Boys' Rules—The Secret War Against the IRA. By Mark Urban. Faber and Faber, London (1992), ISBN 0-571-16112-X, £14.99 相似文献
174.
175.
176.
177.
178.
179.
In this article, we address a stochastic generalized assignment machine scheduling problem in which the processing times of jobs are assumed to be random variables. We develop a branch‐and‐price (B&P) approach for solving this problem wherein the pricing problem is separable with respect to each machine, and has the structure of a multidimensional knapsack problem. In addition, we explore two other extensions of this method—one that utilizes a dual‐stabilization technique and another that incorporates an advanced‐start procedure to obtain an initial feasible solution. We compare the performance of these methods with that of the branch‐and‐cut (B&C) method within CPLEX. Our results show that all B&P‐based approaches perform better than the B&C method, with the best performance obtained for the B&P procedure that includes both the extensions aforementioned. We also utilize a Monte Carlo method within the B&P scheme, which affords the use of a small subset of scenarios at a time to estimate the “true” optimal objective function value. Our experimental investigation reveals that this approach readily yields solutions lying within 5% of optimality, while providing more than a 10‐fold savings in CPU times in comparison with the best of the other proposed B&P procedures. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 131–143, 2014 相似文献
180.