首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   398篇
  免费   5篇
  2020年   8篇
  2019年   11篇
  2018年   12篇
  2017年   14篇
  2016年   11篇
  2015年   8篇
  2014年   7篇
  2013年   127篇
  2011年   3篇
  2010年   4篇
  2009年   4篇
  2008年   5篇
  2007年   3篇
  2006年   4篇
  2005年   5篇
  2003年   2篇
  2002年   2篇
  2001年   5篇
  2000年   3篇
  1999年   4篇
  1998年   7篇
  1997年   6篇
  1996年   6篇
  1995年   9篇
  1994年   7篇
  1993年   6篇
  1992年   10篇
  1991年   12篇
  1990年   4篇
  1989年   6篇
  1988年   5篇
  1987年   7篇
  1986年   8篇
  1985年   7篇
  1984年   4篇
  1983年   2篇
  1982年   4篇
  1981年   2篇
  1980年   6篇
  1978年   4篇
  1977年   2篇
  1976年   2篇
  1975年   5篇
  1974年   6篇
  1973年   5篇
  1972年   2篇
  1971年   2篇
  1970年   3篇
  1968年   2篇
  1967年   2篇
排序方式: 共有403条查询结果,搜索用时 0 毫秒
91.
The system under study is a single item, two‐echelon production‐inventory system consisting of a capacitated production facility, a central warehouse, and M regional distribution centers that satisfy stochastic demand. Our objective is to determine a system base‐stock level which minimizes the long run average system cost per period. Central to the approach are (1) an inventory allocation model and associated convex cost function designed to allocate a given amount of system inventory across locations, and (2) a characterization of the amount of available system inventory using the inventory shortfall random variable. An exact model must consider the possibility that inventories may be imbalanced in a given period. By assuming inventory imbalances cannot occur, we develop an approximation model from which we obtain a lower bound on the per period expected cost. Through an extensive simulation study, we analyze the quality of our approximation, which on average performed within 0.50% of the lower bound. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 377–398, 2000  相似文献   
92.
The reformulation‐linearization technique (RLT) is a methodology for constructing tight linear programming relaxations of mixed discrete problems. A key construct is the multiplication of “product factors” of the discrete variables with problem constraints to form polynomial restrictions, which are subsequently linearized. For special problem forms, the structure of these linearized constraints tends to suggest that certain classes may be more beneficial than others. We examine the usefulness of subsets of constraints for a family of 0–1 quadratic multidimensional knapsack programs and perform extensive computational tests on a classical special case known as the 0–1 quadratic knapsack problem. We consider RLT forms both with and without these inequalities, and their comparisons with linearizations derived from published methods. Interestingly, the computational results depend in part upon the commercial software used. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010  相似文献   
93.
94.
95.
96.
The rise of China has been fuelled by a massive military modernisation programme relying, in large part, on the acquisition of foreign military equipment. The question of how the world’s major powers define their arms transfer policies towards China is therefore crucially important. This article makes two original contributions. First, drawing on neoclassical realism, it proposes an explanatory framework integrating international and domestic factors to explain variations in major powers’ arms transfers. Second, based on a large body of elite interviews and diplomatic cables, it offers the first comprehensive comparison of American, British, French and Russian arms transfer policies towards China since the end of the Cold War.  相似文献   
97.
Targeted killings have become a central tactic in the United States' campaigns against militant and terrorist groups in the Middle East, Asia, and Africa. Both ‘demand’ and ‘supply’ factors explain the rise of targeted killings. Demand for targeted killings increased as the United States faced new threats from militant groups that could not be effectively countered with conventional military force. Concerns about the political consequences of long-term military involvement overseas and American casualties led political leaders to supply more targeted killings. The conclusion discusses how this tactic may have unintended consequences as other states follow the United States use of targeted killings.  相似文献   
98.
We examine the setup and improvement policies for a production process with multiple performance states. Assume that the production process deteriorates randomly over time, following a Markovian process with known transition probabilities. In order to reduce the production cost incurred because of process deterioration, the process is inspected at the end of each period. Then one of three actions may be taken: do nothing, perform routine process setup, or perform routine setup and process improvement. The routine setup operation returns the process to its best performance state, whereas the process improvement action may reduce future production and setup costs and improve the process-state transition probabilities. A discounted Markovian model is formulated to find the strategy that minimizes the total cost of operating the production process. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 383–400, 1997  相似文献   
99.
The authors study a discrete-time, infinite-horizon, dynamic programming model for the replacement of components in a binary k-out-of-n failure system. (The system fails when k or more of its n components fail.) Costs are incurred when the system fails and when failed components are replaced. The objective is to minimize the long-run expected average undiscounted cost per period. A companion article develops a branch-and-bound algorithm for computing optimal policies. Extensive computational experiments find it effective for k to be small or near n; however, difficulties are encountered when n ≥ 30 and 10 ≤ kn − 4. This article presents a simple, intuitive heuristic rule for determining a replacement policy whose memory storage and computation time requirements are O(n − k) and O(n(n − k) + k), respectively. This heuristic is based on a plausible formula for ranking components in order of their usefulness. The authors provide sufficient conditions for it to be optimal and undertake computational experiments that suggest that it handles parallel systems (k = n) effectively and, further, that its effectiveness increases as k moves away from n. In our test problems, the mean relative errors are under 5% when n ≤ 100 and under 2% when kn − 3 and n ≤ 50. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44, 273–286, 1997.  相似文献   
100.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号