首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   407篇
  免费   4篇
  2019年   13篇
  2018年   12篇
  2017年   15篇
  2016年   12篇
  2015年   3篇
  2014年   8篇
  2013年   140篇
  2012年   3篇
  2010年   7篇
  2009年   3篇
  2007年   2篇
  2006年   3篇
  2005年   6篇
  2004年   4篇
  2003年   5篇
  2002年   11篇
  2000年   5篇
  1999年   3篇
  1998年   6篇
  1997年   5篇
  1996年   3篇
  1995年   4篇
  1994年   4篇
  1993年   10篇
  1992年   7篇
  1991年   5篇
  1990年   3篇
  1989年   6篇
  1988年   7篇
  1987年   8篇
  1986年   5篇
  1985年   6篇
  1984年   3篇
  1983年   3篇
  1982年   3篇
  1981年   3篇
  1980年   3篇
  1979年   2篇
  1978年   7篇
  1977年   2篇
  1976年   5篇
  1975年   4篇
  1974年   5篇
  1973年   2篇
  1972年   3篇
  1971年   7篇
  1970年   3篇
  1969年   5篇
  1968年   4篇
  1967年   4篇
排序方式: 共有411条查询结果,搜索用时 15 毫秒
91.
The application of statistical expectation to risk density functions and fee/incentive-element relationships is shown to be useful in structuring contract incentives. A mathematical procedure for calculating the expected value of fee for a given risk/incentive arrangement is described along with cost examples and related sensitivity analyses. The structuring of equivalent incentives is demonstrated by the use of the contracting procedure used for procuring the C-5A aircraft.  相似文献   
92.
This paper considers the classical finite linear transportation Problem (I) and two relaxations, (II) and (III), of it based on papers by Kantorovich and Rubinstein, and Kretschmer. Pseudo-metric type conditions on the cost matrix are given under which Problems (I) and (II) have common optimal value, and a proper subset of these conditions is sufficient for Problems (II) and (III) to have common optimal value. The relationships between the three problems provide a proof of Kantorovich's original characterization of optimal solutions to the standard transportation problem having as many origins as destinations. The result are extended to problems having cost matrices which are nonnegative row-column equivalent.  相似文献   
93.
The purpose of this article is to formulate the multi-commodity maximal flow problem into a node-arc form and to show that when decomposition is applied to this form the resulting master and subproblems become precisely those described by Ford & Fulkerson [3] using the arc-chain formulation. A generalization to the problem is then considered which can potentially speed its convergence.  相似文献   
94.
95.
96.
Suppose a given set of jobs has to be processed on a multi-purpose facility which has various settings or states. There is a choice of states in which to process a job and the cost of processing depends on the state. In addition, there is also a sequence-dependent changeover cost between states. The problem is then to schedule the jobs, and pick an optimum setting for each job, so as to minimize the overall operating costs. A dynamic programming model is developed for obtaining an optimal solution to the problem. The model is then extended using the method of successive approximations with a view to handling large-dimensioned problems. This extension yields good (but not necessarily optimal) solutions at a significant computational saving over the direct dynamic programming approach.  相似文献   
97.
A maximum-likelihood technique is described for estimating the bivariate normal distribution of the estimates of two or more related values when data are obtained from several different sources, each having known variance. The problem is comparable, in the bivariate sense to estimating the mean of a normal population with known variance. The results tend to be dominated by those sources of data associated with the smallest variances.  相似文献   
98.
A mathematical model is developed that enables organization and manpower planners to quantify the inefficiencies involved in rapid buildups of organizations, such as is frequently found in the aerospace industry shortly after the award of a major contract. Consideration is given to the time required to train, indoctrinate, and familiarize new workers with their jobs and the general program aspects. Once trained, workers are assumed to be productive. If the ratio of untrained to trained workers exceeds a critical value, called the buildup threshold, then the performance of the trained workers is degraded to the extent that they are no longer 100 percent efficient until this ratio returns to a value less than the threshold. The model is sufficiently general to consider an arbitrary manpower plan with more than one peak or valley. The model outputs are functions of real time and consist of the fraction of the total labor force which is productive, the fraction of the total labor units expended for nonproductive effort, the cumulative labor costs for productive effort, and the cumulative labor cost for all effort.  相似文献   
99.
100.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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