首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   419篇
  免费   16篇
  2021年   4篇
  2020年   4篇
  2019年   7篇
  2018年   4篇
  2017年   8篇
  2016年   8篇
  2015年   8篇
  2014年   6篇
  2013年   70篇
  2011年   4篇
  2009年   5篇
  2007年   6篇
  2005年   4篇
  2004年   7篇
  2003年   4篇
  2002年   6篇
  2001年   8篇
  2000年   4篇
  1999年   7篇
  1998年   8篇
  1997年   9篇
  1996年   6篇
  1995年   12篇
  1994年   12篇
  1993年   11篇
  1992年   12篇
  1991年   13篇
  1990年   6篇
  1989年   6篇
  1988年   9篇
  1987年   8篇
  1985年   8篇
  1984年   10篇
  1983年   6篇
  1982年   5篇
  1981年   10篇
  1980年   6篇
  1979年   11篇
  1978年   6篇
  1977年   7篇
  1976年   7篇
  1975年   11篇
  1974年   8篇
  1973年   6篇
  1972年   9篇
  1971年   6篇
  1970年   3篇
  1969年   4篇
  1968年   6篇
  1967年   5篇
排序方式: 共有435条查询结果,搜索用时 250 毫秒
91.
This paper presents the details for applying and specializing the work of Ellis Johnson [10] and [11] to develop a primal code for the well-known capacitated transportation problem. The code was developed directly from the work of Johnson, but is similar to codes developed by Glover, Karney, Klingman, and Napier [6] and Srinivasan and Thompson [14]. The emphasis in the presentation is the use of the graphical representation of the basis to carry out the revised simplex operations. This is a means of exploiting the special structure and sparseness of the constraint matrix to minimize computational effort and storage requirements. We also present the results of solving several large problems with the code developed.  相似文献   
92.
93.
This paper considers the problem of defending a set of point targets of differing values. The defense is proportional in that it forces the offense to pay a price, in terms of reentry vehicles expended, that is proportional to the value of the target. The objective of the defense is to balance its resources so that no matter what attack is launched, the offense will have to pay a price greater than or equal to some fixed value for every unit of damage inflicted. The analysis determines which targets should be defended and determines the optimal firing doctrine for interceptors at defended targets. A numerical example is included showing the relationship between the total target damage and the size of the interceptor force for different values of p, the interceptor single shot kill probability. Some generalizations are discussed.  相似文献   
94.
The paper deals with bilinear programming problems and develops a finite algorithm using the “piecewise strategy” for large-scale systems. It consists of systematically generating a sequence of expanding polytopes with the global optimum within each polytope being known. The procedure then stops when the final polytope contains the feasible region.  相似文献   
95.
A model of a deteriorating system with imperfect information is considered. The structures appropriate for such a model include failing machinery and depleted inventory systems. In an effort to add a new dimension to such models, it is assumed that the operator must pay an inspection cost to determine the precise state of the system. At the start of every time period, the operator is faced with three choices: repair, no action, or inspection. Under fairly general assumptions, the optimal policy for repair is found to be straightforward and intuitive. This result has two important areas of application.  相似文献   
96.
In the finite-horizon stochastic (s, S) inventory model with periodic review the parameters of the optimal policy generally vary with the length of the horizon. A stationary policy, however, is easier to implement and may be easier to calculate. This paper studies optimal stationary policies for a finite horizon and relates them to optimal policies through their relation to optimal stationary policies for an infinite horizon.  相似文献   
97.
The problem of assigning computer program modules to functionally similar processors in a distributed computer network is investigated. The modules of a program must be assigned among processors in such a way as to minimize interprocessor communication while taking advantage of affinities of certain modules to particular processors. This problem is formulated as a zero-one quadratic programming problem, but is more conveniently modeled as a directed acyclic search graph. The model is developed and a backward shortest path labeling algorithm is given that produces an assignment of program modules to processors. A non-backtracking branch-and-bound algorithm is described that uses a local neighborhood search at each stage of the search graph.  相似文献   
98.
Let , where A (t)/t is nondecreasing in t, {P(k)1/k} is nonincreasing. It is known that H(t) = 1 — H (t) is an increasing failure rate on the average (IFRA) distribution. A proof based on the IFRA closure theorem is given. H(t) is the distribution of life for systems undergoing shocks occurring according to a Poisson process where P (k) is the probability that the system survives k shocks. The proof given herein shows there is an underlying connection between such models and monotone systems of independent components that explains the IFRA life distribution occurring in both models.  相似文献   
99.
This work is concerned with a particular class of bimatrix games, the set of equilibrium points of which games possess many of the properties of solutions to zero-sum games, including susceptibility to solution by linear programming. Results in a more general setting are also included. Some of the results are believed to constitute interesting potential additions to elementary courses in game theory.  相似文献   
100.
Most maintenance and replacement models for industrial equipment have been developed for independent single-component machines. Most equipment, however, consists of multiple components. Also, when the maintenance crew services several machines, the maintenance policy for each machine is not independent of the states of the other machines. In this paper, two dynamic programming replacement models are presented. The first is used to determine the optimal replacement policy for multi-component equipment. The second is used to determine the optimal replacement policy for a multi-machine system which uses one replacement crew to service several machines. In addition, an approach is suggested for developing an efficient replacement policy for a multi-component, multi-machine system.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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