首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   224篇
  免费   9篇
  2019年   7篇
  2018年   8篇
  2017年   5篇
  2016年   10篇
  2015年   6篇
  2014年   5篇
  2013年   50篇
  2012年   2篇
  2011年   4篇
  2009年   5篇
  2008年   3篇
  2006年   3篇
  2005年   4篇
  2004年   5篇
  2003年   6篇
  2002年   4篇
  2001年   2篇
  2000年   5篇
  1997年   3篇
  1996年   1篇
  1995年   2篇
  1994年   2篇
  1993年   4篇
  1992年   2篇
  1991年   3篇
  1990年   4篇
  1989年   4篇
  1988年   8篇
  1987年   4篇
  1986年   6篇
  1985年   2篇
  1984年   2篇
  1983年   3篇
  1982年   1篇
  1981年   1篇
  1980年   3篇
  1979年   3篇
  1978年   1篇
  1977年   2篇
  1976年   3篇
  1975年   2篇
  1974年   6篇
  1973年   2篇
  1972年   4篇
  1971年   4篇
  1970年   3篇
  1969年   4篇
  1968年   3篇
  1966年   1篇
  1948年   1篇
排序方式: 共有233条查询结果,搜索用时 15 毫秒
161.
162.
163.
164.
Until recently, fast algorithms for the maximum flow problem have typically proceeded by constructing layered networks and establishing blocking flows in these networks. However, in recent years, new distance-directed algorithms have been suggested that do not construct layered networks but instead maintain a distance label with each node. The distance label of a node is a lower bound on the length of the shortest augmenting path from the node to the sink. In this article we develop two distance-directed augmenting path algorithms for the maximum flow problem. Both the algorithms run in O(n2m) time on networks with n nodes and m arcs. We also point out the relationship between the distance labels and layered networks. Using a scaling technique, we improve the complexity of our distance-directed algorithms to O(nm log U), where U denotes the largest arc capacity. We also consider applications of these algorithms to unit capacity maximum flow problems and a class of parametric maximum flow problems.  相似文献   
165.
This article considers the efficient scheduling of a fleet of ships engaged in pickup and delivery of bulk cargoes. Our optimization system begins by generating a menu of candidate schedules for each ship. This menu can contain all feasible solutions, which guarantees we will find an optimal solution or can be heuristically limited to contain only those schedules likely to be in an optimal solution. The problem of choosing from this menu an optimal schedule for the fleet is formulated as a set-packing problem and solved with a dual algorithm. Computational experience is presented based on real data obtained from the Military Sealift Command of the U. S. Navy. Run times for this data were reasonable and solutions were generated with the potential of saving up to about $30 million per year over the manual system currently in place. We also describe a color-graphics interface developed to facilitate interaction with the optimization system.  相似文献   
166.
The exact first four moments of lead-time demand L are derived for an AR(1) and a MA(1) demand structures where the arbitrary lead-time distribution is assumed to be independent of the demand structure. These moments then form a basis for the Pearson curve-fitting procedure for estimating the distribution of L. A normal approximation to L, a version of the central limit theorem, is obtained under some general conditions. Reorder points (ROPs) of an inventory system are then estimated based on the Pearson system and a normal approximation. Their performances are evaluated. Numerical investigation shows that the Pearson system performs extremely well. The normal approximation, however, is good only for some limited cases, and is sensitive to the choice of the lead-time distribution. A possible improvement is noted.  相似文献   
167.
The article presents a Bayesian analysis for the environmental stress screening problem. The decision problem of deriving optimal stress screen durations is solved. Given a screen duration, the optimal stress level can also be determined. Indicators of the quality of a screen of any duration are derived. A statistical model is presented which allows a posterior density for the rate of early failures of the production process to be calculated. This enables the user to update his opinion about the quality of the process. © 1994 John Wiley & Sons, Inc.  相似文献   
168.
We address the so‐called maximum dispersion problems where the objective is to maximize the sum or the minimum of interelement distances amongst a subset chosen from a given set. The problems arise in a variety of contexts including the location of obnoxious facilities, the selection of diverse groups, and the identification of dense subgraphs. They are known to be computationally difficult. In this paper, we propose a Lagrangian approach toward their solution and report the results of an extensive computational experimentation. Our results show that our Lagrangian approach is reasonably fast, that it yields heuristic solutions which provide good lower bounds on the optimum solution values for both the sum and the minimum problems, and further that it produces decent upper bounds in the case of the sum problem. For the sum problem, the results also show that the Lagrangian heuristic compares favorably against several existing heuristics. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 97–114, 2000  相似文献   
169.
A generalized parallel replacement problem is considered with both fixed and variable replacement costs, capital budgeting, and demand constraints. The demand constraints specify that a number of assets, which may vary over time, are required each period over a finite horizon. A deterministic, integer programming formulation is presented as replacement decisions must be integer. However, the linear programming relaxation is shown to have integer extreme points if the economies of scale binary variables are fixed. This allows for the efficient computation of large parallel replacement problems as only a limited number of 0–1 variables are required. Examples are presented to provide insight into replacement rules, such as the “no‐splitting‐rule” from previous research, under various demand scenarios. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 40–56, 2000  相似文献   
170.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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