首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3336篇
  免费   82篇
  国内免费   1篇
  2021年   37篇
  2019年   91篇
  2018年   53篇
  2017年   80篇
  2016年   81篇
  2015年   61篇
  2014年   64篇
  2013年   702篇
  2010年   35篇
  2009年   37篇
  2008年   47篇
  2007年   52篇
  2006年   36篇
  2005年   42篇
  2004年   56篇
  2003年   42篇
  2002年   57篇
  1999年   41篇
  1998年   46篇
  1997年   50篇
  1996年   61篇
  1995年   41篇
  1994年   59篇
  1993年   63篇
  1992年   58篇
  1991年   74篇
  1990年   39篇
  1989年   72篇
  1988年   78篇
  1987年   69篇
  1986年   73篇
  1985年   64篇
  1984年   36篇
  1983年   42篇
  1982年   43篇
  1981年   45篇
  1980年   51篇
  1979年   45篇
  1978年   49篇
  1977年   45篇
  1976年   45篇
  1975年   46篇
  1974年   52篇
  1973年   50篇
  1972年   52篇
  1971年   43篇
  1970年   40篇
  1969年   40篇
  1968年   34篇
  1967年   33篇
排序方式: 共有3419条查询结果,搜索用时 359 毫秒
161.
Consider an “intractable” optimization problem for which no efficient solution technique exists. Given a systematic procedure for generating independent heuristic solutions, we seek to obtain interval estimates for the globally optimal solution using statistical inference. In previous work, accurate point estimates have been derived. Determining interval estimates, however, is a considerably more difficult task. In this paper, we develop straightforward procedures which compute confidence intervals efficiently in order to evaluate heuristic solutions and assess deviations from optimality. The strategy presented is applicable to a host of combinatorial optimization problems. The assumptions of our model, along with computational experience, are discussed.  相似文献   
162.
This paper discusses a class of queueing models in which the service time of a customer al a single server facility is dependent on the queue size at the onset of its service. The Laplace transform for the wait in queue distribution is derived and the utilization of the server is given when the arrival is a homogeneous Poisson process.  相似文献   
163.
Pathbreaking logistics research over the next 10 years will focus on systems problems. Whereas past research generally has taken a “bottom-up” approach, future investigations are likely to pursue a “top-down” philosophy. Specifically, attention will concentrate on diagnosis of systems' improvement potentials; easy-to-use analytic approaches, inherently approximative, will be devised for quickly ascertaining whether a complex operating system can be substantially and effectively improved. Theories to assist in overall systems design, particularly the setting of boundaries and buffers among systems components, will be developed. At the same time, techniques for accurately forecasting future systems performance will be investigated. Underlying such research will be efforts to gain better understanding of management information requirements, including approaches for monitoring systems performance and providing early warning detection of systems degradation Improved management information systems will have to be coupled with appropriate design of managerial organizations and assignment of decision making responsibilities. Important avenues of research will he development of robust approaches, that is, both mathematical techniques and organizational approaches that are not too adversely affected by limited data, a changing environment, and human frailly. Finally, critical research will be directed at the implementation process, especially the interaction among initiation, design, testing and ultimate adoption This prognosis will explore the above themes in the context of large-scale, complex systems. The decision areas will encompass inventory replenishment, multiechelon hierarchies for stockage and maintenance, procurement, transportation, scheduling, facilities planning, budgeting, reliability and personnel management.  相似文献   
164.
About thirty references that feature naval logistics environments are considered. All are unclassified and all appear in the open literature or are available from the Defense Logistics Studies Information Exchange. Three approaches are identified–data analysis, theoretical models, and readiness indexes–and conclusions are presented as to possibilities for answering two questions: (a) Can the unit do the job? (b) How does readiness depend on resources? Four cases are treated in detail to illustrate methodology.  相似文献   
165.
This paper reconsiders the classical model for selling an asset in which offers come in daily and a decision must then be made as to whether or not to sell. For each day the item remains unsold a continuation (or maintenance cost) c is incurred. The successive offers are assumed to be independent and identically distributed random variables having an unknown distribution F. The model is considered both in the case where once an offer is rejected it may not be recalled at a later time and in the case where such recall of previous offers is allowed.  相似文献   
166.
In this paper we discuss the properties of a Bilinear Programming problem, and develop a convergent cutting plane algorithm. The cuts involve only a subset of the variables and preserve the special structure of the constraints involving the remaining variables. The cuts are deeper than other similar cuts.  相似文献   
167.
An explicit steady state solution is determined for the distribution of the number of customers for a queueing system in which Poisson arrivals are bulks of random size. The number of customers per bulk varies randomly between 1 and m, m arbitrary, according to a point multinomial, and customer service is exponential. Queue characteristics are given.  相似文献   
168.
The purpose of this paper and the accompanying tables is to facilitate the calculation of constrained optimum order quantities and reorder points for an inventory control system where the criterion of optimality is the minimization of expected inventory holding, ordering, and time-weighted backorder costs. The tables provided in the paper allow the identification of the optimal solution when order quantities and/or reorder points are restricted to a set of values which do not include the unconstrained optimal solution.  相似文献   
169.
The problem of multiple-resource capacity planning under an infinite time horizon is analyzed using a nonlinear programming model. The analysis generalizes to the long term the short-run pricing model for computer networks developed in Kriebel and Mikhail [5]. The environment assumes heterogeneous resource capacities by age (vingate), which service a heterogeneous and relatively captive market of users with known demand functions in each time period. Total variable operating costs are given by a continuous psuedoconcave function of system load, capacity, and resource age. Optimal investment, pricing, and replacement decision rules are derived in the presence of economies of scale and exogenous technological progress. Myopic properties of the decision rules which define natural (finite) planning subhorizons are discussed.  相似文献   
170.
Using the general computational strategy of restriction, necessary conditions for optimality provide an alternative criterion for entering variables when degeneracies arises in linear programming problems. Although cycling may still occur, it is shown that if it is possible to make progress at the next iteration, the criterion is guaranteed to identify a non-basic variable which increases the value of the basic solution, thereby reducing stalling. An alternative method for determining variables to exit the basis when degeneracies occur is also suggested.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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