全文获取类型
收费全文 | 453篇 |
免费 | 17篇 |
出版年
2021年 | 4篇 |
2020年 | 5篇 |
2019年 | 7篇 |
2017年 | 8篇 |
2016年 | 10篇 |
2015年 | 9篇 |
2014年 | 8篇 |
2013年 | 80篇 |
2011年 | 5篇 |
2009年 | 5篇 |
2007年 | 8篇 |
2006年 | 4篇 |
2005年 | 4篇 |
2004年 | 9篇 |
2003年 | 4篇 |
2002年 | 8篇 |
2001年 | 7篇 |
2000年 | 5篇 |
1999年 | 8篇 |
1998年 | 9篇 |
1997年 | 10篇 |
1996年 | 9篇 |
1995年 | 12篇 |
1994年 | 12篇 |
1993年 | 12篇 |
1992年 | 12篇 |
1991年 | 11篇 |
1990年 | 8篇 |
1989年 | 10篇 |
1988年 | 9篇 |
1987年 | 11篇 |
1986年 | 4篇 |
1985年 | 12篇 |
1984年 | 9篇 |
1983年 | 7篇 |
1982年 | 5篇 |
1981年 | 9篇 |
1980年 | 6篇 |
1979年 | 12篇 |
1978年 | 6篇 |
1977年 | 7篇 |
1976年 | 6篇 |
1975年 | 8篇 |
1974年 | 7篇 |
1973年 | 7篇 |
1972年 | 8篇 |
1971年 | 6篇 |
1969年 | 3篇 |
1968年 | 6篇 |
1967年 | 5篇 |
排序方式: 共有470条查询结果,搜索用时 15 毫秒
151.
Clustering problems are often difficult to solve due to nonlinear cost functions and complicating constraints. Set partitioning formulations can help overcome these challenges, but at the cost of a very large number of variables. Therefore, techniques such as delayed column generation must be used to solve these large integer programs. The underlying pricing problem can suffer from the same challenges (non‐linear cost, complicating constraints) as the original problem, however, making a mathematical programming approach intractable. Motivated by a real‐world problem in printed circuit board (PCB) manufacturing, we develop a search‐based algorithm (Rank‐Cluster‐and‐Prune) as an alternative, present computational results for the PCB problem to demonstrate the tractability of our approach, and identify a broader class of clustering problems for which this approach can be used. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
152.
Michael C. Fu 《海军后勤学研究》2008,55(8):723-736
Derivatives (or gradients) are important for both sensitivity analysis and optimization, and in simulation models, these can often be estimated efficiently using various methods other than brute‐force finite differences. This article briefly summarizes the main approaches and discusses areas in which the approaches can most fruitfully be applied: queueing, inventory, and finance. In finance, the focus is on derivatives of another sort. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
153.
154.
We consider parallel‐machine scheduling with a common server and job preemption to minimize the makespan. While the non‐preemptive version of the problem is strongly NP‐hard, the complexity status of the preemptive version has remained open. We show that the preemptive version is NP‐hard even if there is a fixed number of machines. We give a pseudo‐polynomial time algorithm to solve the case with two machines. We show that the case with an arbitrary number of machines is unary NP‐hard, analyze the performance ratios of some natural heuristic algorithms, and present several solvable special cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 388–398, 2017 相似文献
155.
The Replenishment at Sea Planner (RASP) is saving the U.S. Navy millions of dollars a year by reducing fuel consumption of its Combat Logistics Force (CLF). CLF shuttle supply ships deploy from ports to rendezvous with underway U.S. combatants and those of coalition partners. The overwhelming commodity transferred is fuel, ship‐to‐ship by hoses, while other important packaged goods and spare parts are high‐lined, or helicoptered between ships. The U.S. Navy is organized in large areas of responsibility called numbered fleets, and within each of these a scheduler must promulgate a daily forecast of CLF shuttle operations. The operational planning horizon extends out several weeks, or as far into the future as we can forecast demand. We solve RASP with integer linear optimization and a purpose‐built heuristic. RASP plans Replenishment‐at‐Sea (RAS) events with 4‐hour (Navy watch) time fidelity. For five years, RASP has served two purposes: (1) it helps schedulers generate a daily schedule and animates it using Google Earth, and (2) it automates reports command‐to‐ship messages that are essential to keep this complex logistics system operating. 相似文献
156.
157.
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 相似文献
158.
The drivers of HIV/AIDS in the South African Police Service (SAPS) and impact of the disease on this workforce are neglected areas of research. Existing evidence suggests that while the occupational risk for contracting HIV is low, there are factors associated with the profession that, if left unmanaged, place police officers at risk of contracting HIV. This study's two aims are to identify the potential pathways of HIV infection within policing services and determine the probable impact of HIV/AIDS on SAPS. Through a systematic literature review on HIV/AIDS within police services, and by analysing selected SAPS human resource data, the causal pathways and impact of HIV/AIDS on police services are explored. The study finds that police officers (particularly male officers) are likely to be highly susceptible to HIV infection as a result of risky sexual behaviours born out of occupational characteristics such as high levels of stress, difficult working conditions, living away from home and interactions with sex workers. The problem is exacerbated by the ‘macho’ culture that often prevails among police officers. HIV/AIDS interventions within SAPS must focus on sustained behaviour change. Further, HIV programmes must equip officers with the knowledge and awareness to avoid engaging in high-risk sexual practices that may compromise their health and the effectiveness of the policing service. 相似文献
159.
Goodness C. Aye Mehmet Balcilar Rangan Gupta Reneé van Eyden 《Defence and Peace Economics》2014,25(6):619-633
This paper contributes to the growing literature on the milex-growth nexus, by providing a case study of South Africa and considering the possibility of structural breaks by applying newly developed econometric methods. Using full sample bootstrap Granger non-causality tests, no Granger causal link is found between military expenditure and GDP for 1951–2010, but parameter instability tests show the estimated VARs to be unstable. Using a bootstrap rolling window estimation procedure, however, finds evidence of bidirectional Granger causality in various subsamples. This implies standard Granger non-causality tests, which neither account for structural breaks nor time variation may be invalid. 相似文献
160.